./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 dc59d56a03b0e275b4f62d2522e0dff35f3e7a25 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:06:11,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:06:11,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:06:11,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:06:11,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:06:11,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:06:11,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:06:11,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:06:11,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:06:11,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:06:11,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:06:11,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:06:11,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:06:11,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:06:11,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:06:11,461 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:06:11,462 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:06:11,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:06:11,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:06:11,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:06:11,469 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:06:11,470 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:06:11,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:06:11,473 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:06:11,473 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:06:11,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:06:11,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:06:11,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:06:11,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:06:11,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:06:11,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:06:11,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:06:11,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:06:11,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:06:11,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:06:11,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:06:11,482 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:06:11,514 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:06:11,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:06:11,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:06:11,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:06:11,517 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:06:11,517 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:06:11,518 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:06:11,518 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:06:11,518 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:06:11,518 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:06:11,518 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:06:11,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:06:11,520 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:06:11,520 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:06:11,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:06:11,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:06:11,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:06:11,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:06:11,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:06:11,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:06:11,521 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:06:11,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:06:11,521 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:06:11,521 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:06:11,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:06:11,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:06:11,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:06:11,523 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:06:11,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:06:11,524 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:06:11,524 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:06:11,525 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:06:11,525 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> dc59d56a03b0e275b4f62d2522e0dff35f3e7a25 [2019-01-02 00:06:11,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:06:11,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:06:11,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:06:11,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:06:11,582 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:06:11,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2019-01-02 00:06:11,642 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cc7dc13/2fd34f10b68f4042b4f1207007110747/FLAG7adc649d0 [2019-01-02 00:06:12,208 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:06:12,209 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2019-01-02 00:06:12,225 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cc7dc13/2fd34f10b68f4042b4f1207007110747/FLAG7adc649d0 [2019-01-02 00:06:12,434 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cc7dc13/2fd34f10b68f4042b4f1207007110747 [2019-01-02 00:06:12,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:06:12,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:06:12,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:06:12,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:06:12,445 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:06:12,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:12,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12, skipping insertion in model container [2019-01-02 00:06:12,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:12,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:06:12,505 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:06:12,862 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:06:12,879 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:06:12,970 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:06:12,996 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:06:12,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12 WrapperNode [2019-01-02 00:06:12,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:06:12,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:06:12,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:06:12,998 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:06:13,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:06:13,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:06:13,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:06:13,178 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:06:13,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... [2019-01-02 00:06:13,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:06:13,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:06:13,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:06:13,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:06:13,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:06:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:06:16,513 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:06:16,513 INFO L280 CfgBuilder]: Removed 173 assue(true) statements. [2019-01-02 00:06:16,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:06:16 BoogieIcfgContainer [2019-01-02 00:06:16,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:06:16,515 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:06:16,515 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:06:16,519 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:06:16,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:06:16,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:06:12" (1/3) ... [2019-01-02 00:06:16,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c71e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:06:16, skipping insertion in model container [2019-01-02 00:06:16,521 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:06:16,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:06:12" (2/3) ... [2019-01-02 00:06:16,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c71e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:06:16, skipping insertion in model container [2019-01-02 00:06:16,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:06:16,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:06:16" (3/3) ... [2019-01-02 00:06:16,530 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2019-01-02 00:06:16,590 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:06:16,591 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:06:16,591 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:06:16,591 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:06:16,593 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:06:16,593 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:06:16,593 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:06:16,593 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:06:16,594 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:06:16,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states. [2019-01-02 00:06:16,698 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 458 [2019-01-02 00:06:16,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:16,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:16,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:06:16,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:06:16,709 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:06:16,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states. [2019-01-02 00:06:16,723 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 458 [2019-01-02 00:06:16,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:16,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:16,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:06:16,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:06:16,735 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRYtrue ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 233#L-1true 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;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;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; 403#L116-2true [2019-01-02 00:06:16,735 INFO L796 eck$LassoCheckResult]: Loop: 403#L116-2true assume !!(add_history_type_~var~0 < 3); 375#L117true assume !(0 == add_history_type_~history_id); 226#L123true assume !(1 == add_history_type_~history_id); 467#L129true assume !(2 == add_history_type_~history_id); 201#L135true assume !(3 == add_history_type_~history_id); 199#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; 403#L116-2true [2019-01-02 00:06:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-02 00:06:16,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:16,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1278004263, now seen corresponding path program 1 times [2019-01-02 00:06:16,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:16,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash 358053481, now seen corresponding path program 1 times [2019-01-02 00:06:16,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:16,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:17,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:17,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:17,191 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-02 00:06:17,353 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-02 00:06:17,370 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:17,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:17,372 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:17,372 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:17,372 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:06:17,373 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:17,373 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:17,373 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:17,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2019-01-02 00:06:17,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:17,374 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:17,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:17,966 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 8 [2019-01-02 00:06:17,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:17,985 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:17,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:17,991 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,018 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,050 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:18,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,088 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:18,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,114 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:18,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,166 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:18,181 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,182 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,252 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:18,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,267 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:18,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,313 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,362 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,362 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,372 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,401 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,401 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,433 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:18,433 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:18,456 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:18,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:06:18,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:18,509 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:06:18,511 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:18,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:18,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:18,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:18,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:06:18,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:18,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:18,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:18,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2019-01-02 00:06:18,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:18,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:18,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:18,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:19,258 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 8 [2019-01-02 00:06:19,278 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:19,283 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:06:19,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:19,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,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 [2019-01-02 00:06:19,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:19,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:19,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,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 [2019-01-02 00:06:19,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:19,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:19,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:19,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,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 [2019-01-02 00:06:19,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:19,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,414 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:06:19,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,415 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:06:19,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:19,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:19,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 [2019-01-02 00:06:19,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:19,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:19,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:19,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:19,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:19,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:19,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:19,425 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:06:19,429 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:06:19,429 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:06:19,432 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:06:19,433 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:06:19,433 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:06:19,433 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 [] [2019-01-02 00:06:19,437 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:06:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:19,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:19,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:19,612 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 [2019-01-02 00:06:19,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 477 states. Second operand 3 states. [2019-01-02 00:06:19,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 477 states.. Second operand 3 states. Result 1971 states and 3291 transitions. Complement of second has 8 states. [2019-01-02 00:06:19,852 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 [2019-01-02 00:06:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:06:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1723 transitions. [2019-01-02 00:06:19,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1723 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-02 00:06:19,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:19,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1723 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-02 00:06:19,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:19,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1723 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-02 00:06:19,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:19,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1971 states and 3291 transitions. [2019-01-02 00:06:19,890 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 828 [2019-01-02 00:06:19,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1971 states to 950 states and 1590 transitions. [2019-01-02 00:06:19,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2019-01-02 00:06:19,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 898 [2019-01-02 00:06:19,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 950 states and 1590 transitions. [2019-01-02 00:06:19,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:19,917 INFO L705 BuchiCegarLoop]: Abstraction has 950 states and 1590 transitions. [2019-01-02 00:06:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1590 transitions. [2019-01-02 00:06:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 734. [2019-01-02 00:06:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-01-02 00:06:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1237 transitions. [2019-01-02 00:06:19,996 INFO L728 BuchiCegarLoop]: Abstraction has 734 states and 1237 transitions. [2019-01-02 00:06:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:20,004 INFO L87 Difference]: Start difference. First operand 734 states and 1237 transitions. Second operand 3 states. [2019-01-02 00:06:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:20,457 INFO L93 Difference]: Finished difference Result 915 states and 1472 transitions. [2019-01-02 00:06:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:20,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 915 states and 1472 transitions. [2019-01-02 00:06:20,468 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 804 [2019-01-02 00:06:20,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 915 states to 861 states and 1418 transitions. [2019-01-02 00:06:20,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 845 [2019-01-02 00:06:20,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 845 [2019-01-02 00:06:20,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1418 transitions. [2019-01-02 00:06:20,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:20,482 INFO L705 BuchiCegarLoop]: Abstraction has 861 states and 1418 transitions. [2019-01-02 00:06:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1418 transitions. [2019-01-02 00:06:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 424. [2019-01-02 00:06:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-01-02 00:06:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 706 transitions. [2019-01-02 00:06:20,519 INFO L728 BuchiCegarLoop]: Abstraction has 424 states and 706 transitions. [2019-01-02 00:06:20,519 INFO L608 BuchiCegarLoop]: Abstraction has 424 states and 706 transitions. [2019-01-02 00:06:20,519 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:06:20,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 706 transitions. [2019-01-02 00:06:20,523 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 378 [2019-01-02 00:06:20,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:20,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:20,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:06:20,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:06:20,526 INFO L794 eck$LassoCheckResult]: Stem: 4517#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 4463#L-1 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;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;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; 4464#L116-2 assume !(add_history_type_~var~0 < 3); 4564#L116-3 add_history_type_#res := 1; 4514#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4387#L255 assume !(0 == init_~tmp~1);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; 4388#L116-6 [2019-01-02 00:06:20,527 INFO L796 eck$LassoCheckResult]: Loop: 4388#L116-6 assume !!(add_history_type_~var~0 < 3); 4569#L117-2 assume !(0 == add_history_type_~history_id); 4457#L123-2 assume !(1 == add_history_type_~history_id); 4459#L129-2 assume !(2 == add_history_type_~history_id); 4431#L135-3 assume !(3 == add_history_type_~history_id); 4199#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; 4388#L116-6 [2019-01-02 00:06:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash 889868154, now seen corresponding path program 1 times [2019-01-02 00:06:20,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:20,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:20,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:20,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:20,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:20,635 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 261434407, now seen corresponding path program 1 times [2019-01-02 00:06:20,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:20,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:20,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:20,840 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-02 00:06:20,853 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:20,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:20,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:20,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:20,853 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:06:20,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:20,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:20,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:20,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2019-01-02 00:06:20,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:20,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:20,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:20,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:20,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:20,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:21,413 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-02 00:06:21,684 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:21,685 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:21,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,695 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:21,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,710 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,735 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,756 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,772 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,833 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,833 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,839 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,859 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,859 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,869 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:21,895 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:21,920 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:21,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:06:21,963 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:21,987 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:06:21,989 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:21,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:21,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:21,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:21,989 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:06:21,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:21,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:21,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:21,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2019-01-02 00:06:21,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:21,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:21,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:22,341 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:22,341 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:06:22,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:22,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:22,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:22,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:22,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:22,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:22,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:22,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:22,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:22,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:22,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:22,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:22,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:22,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:22,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:22,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:22,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:22,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:22,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:22,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:22,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:22,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:22,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:22,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:22,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:22,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:22,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:22,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:22,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:22,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:22,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:22,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:22,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:22,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:22,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:22,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:22,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:22,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:22,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:22,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:22,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:22,385 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:06:22,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:06:22,388 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:06:22,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:06:22,388 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:06:22,388 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:06:22,389 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 [] [2019-01-02 00:06:22,389 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:06:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:22,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:22,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:22,489 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 [2019-01-02 00:06:22,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 706 transitions. cyclomatic complexity: 290 Second operand 3 states. [2019-01-02 00:06:22,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 706 transitions. cyclomatic complexity: 290. Second operand 3 states. Result 1555 states and 2561 transitions. Complement of second has 7 states. [2019-01-02 00:06:22,704 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 [2019-01-02 00:06:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:06:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1179 transitions. [2019-01-02 00:06:22,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1179 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-02 00:06:22,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:22,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1179 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-02 00:06:22,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:22,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1179 transitions. Stem has 6 letters. Loop has 12 letters. [2019-01-02 00:06:22,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:22,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1555 states and 2561 transitions. [2019-01-02 00:06:22,725 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 962 [2019-01-02 00:06:22,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1555 states to 1120 states and 1844 transitions. [2019-01-02 00:06:22,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1046 [2019-01-02 00:06:22,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1049 [2019-01-02 00:06:22,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1120 states and 1844 transitions. [2019-01-02 00:06:22,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:22,740 INFO L705 BuchiCegarLoop]: Abstraction has 1120 states and 1844 transitions. [2019-01-02 00:06:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states and 1844 transitions. [2019-01-02 00:06:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 476. [2019-01-02 00:06:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-01-02 00:06:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 791 transitions. [2019-01-02 00:06:22,757 INFO L728 BuchiCegarLoop]: Abstraction has 476 states and 791 transitions. [2019-01-02 00:06:22,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:22,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:22,759 INFO L87 Difference]: Start difference. First operand 476 states and 791 transitions. Second operand 3 states. [2019-01-02 00:06:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:23,125 INFO L93 Difference]: Finished difference Result 935 states and 1549 transitions. [2019-01-02 00:06:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:23,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 935 states and 1549 transitions. [2019-01-02 00:06:23,136 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 536 [2019-01-02 00:06:23,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 935 states to 935 states and 1549 transitions. [2019-01-02 00:06:23,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 797 [2019-01-02 00:06:23,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 797 [2019-01-02 00:06:23,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 935 states and 1549 transitions. [2019-01-02 00:06:23,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:23,148 INFO L705 BuchiCegarLoop]: Abstraction has 935 states and 1549 transitions. [2019-01-02 00:06:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states and 1549 transitions. [2019-01-02 00:06:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 478. [2019-01-02 00:06:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-01-02 00:06:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 791 transitions. [2019-01-02 00:06:23,162 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 791 transitions. [2019-01-02 00:06:23,163 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 791 transitions. [2019-01-02 00:06:23,163 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:06:23,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 791 transitions. [2019-01-02 00:06:23,168 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 323 [2019-01-02 00:06:23,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:23,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:23,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:23,174 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] [2019-01-02 00:06:23,174 INFO L794 eck$LassoCheckResult]: Stem: 8013#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 7954#L-1 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;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;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; 7955#L116-2 assume !!(add_history_type_~var~0 < 3); 8052#L117 assume 0 == add_history_type_~history_id;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; 7720#L171 assume 0 == read_history_bool_~history_id; 7721#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7727#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 7846#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8009#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 7862#L255 assume 0 == init_~tmp~1;init_#res := 0; 7740#L270 main_#t~ret57 := init_#res;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; 7742#L550-2 [2019-01-02 00:06:23,179 INFO L796 eck$LassoCheckResult]: Loop: 7742#L550-2 assume !!(main_~i2~0 < 10);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;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; 7736#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; 7711#L570-16 assume 0 != ~gate1Failed~0 % 256; 7734#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 7735#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; 7743#L409 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;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; 7718#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; 7694#L570-17 assume 0 != ~gate2Failed~0 % 256; 7697#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 7680#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; 7681#L440 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;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; 8015#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; 7699#L570-18 assume 0 != ~gate3Failed~0 % 256; 7868#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 7860#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; 7861#L471 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; 7864#L486 assume ~VALUE1~0 == ~VALUE2~0; 7866#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 7683#L570-19 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; 7937#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; 7685#L570-20 ~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;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; 7993#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 7930#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 7931#L171-12 assume 0 == read_history_bool_~history_id; 8047#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7771#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 7812#L307 assume !(0 == check_~tmp___3~0 % 256); 7897#L307-1 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; 7963#L151-7 assume 3 == read_history_int8_~history_id; 7978#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7880#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 7856#L346 assume !(check_~tmp___10~0 > -2); 7836#L346-1 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; 7837#L151-9 assume 3 == read_history_int8_~history_id; 7973#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7876#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 7919#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 7855#L366-1 check_#res := 1; 7700#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 7701#L575-72 assume !(0 == assert_~arg % 256); 7840#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 7742#L550-2 [2019-01-02 00:06:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1494216267, now seen corresponding path program 1 times [2019-01-02 00:06:23,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:23,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:23,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:23,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:06:23,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1417533931, now seen corresponding path program 1 times [2019-01-02 00:06:23,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:23,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:23,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:23,349 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:23,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:23,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:23,349 INFO L87 Difference]: Start difference. First operand 478 states and 791 transitions. cyclomatic complexity: 321 Second operand 3 states. [2019-01-02 00:06:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:23,407 INFO L93 Difference]: Finished difference Result 479 states and 791 transitions. [2019-01-02 00:06:23,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:23,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 791 transitions. [2019-01-02 00:06:23,417 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 323 [2019-01-02 00:06:23,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 478 states and 787 transitions. [2019-01-02 00:06:23,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2019-01-02 00:06:23,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2019-01-02 00:06:23,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 478 states and 787 transitions. [2019-01-02 00:06:23,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:23,424 INFO L705 BuchiCegarLoop]: Abstraction has 478 states and 787 transitions. [2019-01-02 00:06:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states and 787 transitions. [2019-01-02 00:06:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-01-02 00:06:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-01-02 00:06:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 787 transitions. [2019-01-02 00:06:23,436 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 787 transitions. [2019-01-02 00:06:23,436 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 787 transitions. [2019-01-02 00:06:23,436 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:06:23,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 787 transitions. [2019-01-02 00:06:23,441 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 323 [2019-01-02 00:06:23,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:23,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:23,443 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] [2019-01-02 00:06:23,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:06:23,444 INFO L794 eck$LassoCheckResult]: Stem: 8977#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 8919#L-1 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;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;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; 8920#L116-2 assume !!(add_history_type_~var~0 < 3); 9016#L117 assume 0 == add_history_type_~history_id;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; 8684#L171 assume 0 == read_history_bool_~history_id; 8685#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8691#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8810#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8975#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8826#L255 assume !(0 == init_~tmp~1);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; 8827#L116-6 assume !!(add_history_type_~var~0 < 3); 9036#L117-2 assume 0 == add_history_type_~history_id;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; 9005#L171-3 assume 0 == read_history_bool_~history_id; 9008#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8767#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8774#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8620#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 8702#L259 assume !(0 == init_~tmp___0~1);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; 8703#L116-10 assume !!(add_history_type_~var~0 < 3); 9031#L117-4 [2019-01-02 00:06:23,444 INFO L796 eck$LassoCheckResult]: Loop: 9031#L117-4 assume !(0 == add_history_type_~history_id); 8906#L123-4 assume !(1 == add_history_type_~history_id); 8908#L129-4 assume !(2 == add_history_type_~history_id); 8871#L135-6 assume !(3 == add_history_type_~history_id); 8604#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; 9039#L116-10 assume !!(add_history_type_~var~0 < 3); 9031#L117-4 [2019-01-02 00:06:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 576829260, now seen corresponding path program 1 times [2019-01-02 00:06:23,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:23,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:23,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:23,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:06:23,531 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1197341531, now seen corresponding path program 1 times [2019-01-02 00:06:23,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:23,633 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:23,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:23,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:23,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:23,633 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:06:23,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:23,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:23,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:23,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:06:23,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:23,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:23,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:23,944 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-02 00:06:24,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:24,224 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:24,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:24,233 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:24,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:06:24,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:24,324 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:06:24,326 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:24,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:24,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:24,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:24,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:06:24,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:24,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:24,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:24,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:06:24,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:24,328 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:24,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:24,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06: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 [2019-01-02 00:06: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 [2019-01-02 00:06: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 [2019-01-02 00:06:24,748 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 8 [2019-01-02 00:06:24,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:24,761 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:06:24,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:24,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:24,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:24,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:24,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:24,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:24,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:24,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:24,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:24,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:24,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:24,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:24,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:24,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:24,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:24,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:24,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:06:24,789 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:06:24,789 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:06:24,790 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:06:24,790 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:06:24,790 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:06:24,790 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 [] [2019-01-02 00:06:24,791 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:06:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:24,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:24,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:24,999 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 [2019-01-02 00:06:25,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 787 transitions. cyclomatic complexity: 317 Second operand 4 states. [2019-01-02 00:06:25,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 787 transitions. cyclomatic complexity: 317. Second operand 4 states. Result 539 states and 889 transitions. Complement of second has 7 states. [2019-01-02 00:06:25,148 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 [2019-01-02 00:06:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:06:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2019-01-02 00:06:25,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 6 letters. [2019-01-02 00:06:25,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:25,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 25 letters. Loop has 6 letters. [2019-01-02 00:06:25,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:25,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 12 letters. [2019-01-02 00:06:25,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:25,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 889 transitions. [2019-01-02 00:06:25,161 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 268 [2019-01-02 00:06:25,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 534 states and 880 transitions. [2019-01-02 00:06:25,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2019-01-02 00:06:25,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2019-01-02 00:06:25,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 880 transitions. [2019-01-02 00:06:25,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:25,170 INFO L705 BuchiCegarLoop]: Abstraction has 534 states and 880 transitions. [2019-01-02 00:06:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 880 transitions. [2019-01-02 00:06:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 530. [2019-01-02 00:06:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-01-02 00:06:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 876 transitions. [2019-01-02 00:06:25,181 INFO L728 BuchiCegarLoop]: Abstraction has 530 states and 876 transitions. [2019-01-02 00:06:25,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:06:25,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:06:25,183 INFO L87 Difference]: Start difference. First operand 530 states and 876 transitions. Second operand 4 states. [2019-01-02 00:06:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:25,463 INFO L93 Difference]: Finished difference Result 752 states and 1233 transitions. [2019-01-02 00:06:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:06:25,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 1233 transitions. [2019-01-02 00:06:25,469 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 481 [2019-01-02 00:06:25,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 736 states and 1207 transitions. [2019-01-02 00:06:25,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2019-01-02 00:06:25,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 610 [2019-01-02 00:06:25,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 1207 transitions. [2019-01-02 00:06:25,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:25,475 INFO L705 BuchiCegarLoop]: Abstraction has 736 states and 1207 transitions. [2019-01-02 00:06:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 1207 transitions. [2019-01-02 00:06:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 516. [2019-01-02 00:06:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-02 00:06:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 851 transitions. [2019-01-02 00:06:25,487 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 851 transitions. [2019-01-02 00:06:25,487 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 851 transitions. [2019-01-02 00:06:25,487 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:06:25,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 851 transitions. [2019-01-02 00:06:25,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 268 [2019-01-02 00:06:25,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:25,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:25,493 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:25,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:06:25,495 INFO L794 eck$LassoCheckResult]: Stem: 11407#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 11345#L-1 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;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;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; 11346#L116-2 assume !!(add_history_type_~var~0 < 3); 11454#L117 assume 0 == add_history_type_~history_id;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; 11094#L171 assume 0 == read_history_bool_~history_id; 11095#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11098#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11228#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11282#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; 11283#L116-2 assume !(add_history_type_~var~0 < 3); 11467#L116-3 add_history_type_#res := 1; 11405#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11243#L255 assume !(0 == init_~tmp~1);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; 11244#L116-6 assume !!(add_history_type_~var~0 < 3); 11473#L117-2 assume 0 == add_history_type_~history_id;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; 11442#L171-3 assume 0 == read_history_bool_~history_id; 11445#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11177#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11181#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11022#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11106#L259 assume !(0 == init_~tmp___0~1);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; 11107#L116-10 assume !!(add_history_type_~var~0 < 3); 11433#L117-4 assume 0 == add_history_type_~history_id;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; 11435#L171-6 assume 0 == read_history_bool_~history_id; 11431#L172-6 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11146#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11150#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11009#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11343#L263 assume !(0 == init_~tmp___1~1);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; 11344#L116-14 assume !!(add_history_type_~var~0 < 3); 11461#L117-6 [2019-01-02 00:06:25,496 INFO L796 eck$LassoCheckResult]: Loop: 11461#L117-6 assume !(0 == add_history_type_~history_id); 11327#L123-6 assume !(1 == add_history_type_~history_id); 11329#L129-6 assume !(2 == add_history_type_~history_id); 11080#L135-9 assume !(3 == add_history_type_~history_id); 11001#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; 11475#L116-14 assume !!(add_history_type_~var~0 < 3); 11461#L117-6 [2019-01-02 00:06:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2009806385, now seen corresponding path program 1 times [2019-01-02 00:06:25,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:25,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:25,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:25,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:06:25,597 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash 180771675, now seen corresponding path program 1 times [2019-01-02 00:06:25,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:25,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:25,715 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:25,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:25,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:25,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:25,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:06:25,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:25,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:25,716 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:25,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2019-01-02 00:06:25,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:25,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:25,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:25,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:26,385 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,396 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,396 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,438 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,438 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:26,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,445 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:26,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,447 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,490 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,498 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,540 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:26,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,550 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:26,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,563 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,588 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,613 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:26,613 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:06:26,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:26,635 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:26,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:06:26,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:26,735 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:06:26,736 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:26,736 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:26,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:26,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:26,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:06:26,737 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:26,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:26,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:26,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2019-01-02 00:06:26,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:26,737 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:26,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,859 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-02 00:06:26,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:26,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:27,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:27,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:06:27,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:27,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:27,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:27,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:27,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:27,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:27,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:27,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:27,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,115 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:06:27,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,123 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:06:27,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:27,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:27,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:27,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,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 [2019-01-02 00:06:27,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:27,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:27,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,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 [2019-01-02 00:06:27,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:27,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:27,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:06:27,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:06:27,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:06:27,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:06:27,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:06:27,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:06:27,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:06:27,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:06:27,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:06:27,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:06:27,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:06:27,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:06:27,172 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:06:27,172 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:06:27,172 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:06:27,172 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:06:27,176 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:06:27,176 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 [] [2019-01-02 00:06:27,176 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:06:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:27,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:27,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:06:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:27,590 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 [2019-01-02 00:06:27,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 516 states and 851 transitions. cyclomatic complexity: 343 Second operand 4 states. [2019-01-02 00:06:27,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 516 states and 851 transitions. cyclomatic complexity: 343. Second operand 4 states. Result 1219 states and 2005 transitions. Complement of second has 6 states. [2019-01-02 00:06:27,843 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 [2019-01-02 00:06:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:06:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1016 transitions. [2019-01-02 00:06:27,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1016 transitions. Stem has 30 letters. Loop has 6 letters. [2019-01-02 00:06:27,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:27,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1016 transitions. Stem has 36 letters. Loop has 6 letters. [2019-01-02 00:06:27,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:27,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1016 transitions. Stem has 30 letters. Loop has 12 letters. [2019-01-02 00:06:27,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:06:27,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1219 states and 2005 transitions. [2019-01-02 00:06:27,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:06:27,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1219 states to 786 states and 1294 transitions. [2019-01-02 00:06:27,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 603 [2019-01-02 00:06:27,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2019-01-02 00:06:27,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 1294 transitions. [2019-01-02 00:06:27,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:27,878 INFO L705 BuchiCegarLoop]: Abstraction has 786 states and 1294 transitions. [2019-01-02 00:06:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 1294 transitions. [2019-01-02 00:06:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 568. [2019-01-02 00:06:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-01-02 00:06:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 940 transitions. [2019-01-02 00:06:27,890 INFO L728 BuchiCegarLoop]: Abstraction has 568 states and 940 transitions. [2019-01-02 00:06:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:06:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:06:27,893 INFO L87 Difference]: Start difference. First operand 568 states and 940 transitions. Second operand 5 states. [2019-01-02 00:06:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:28,811 INFO L93 Difference]: Finished difference Result 700 states and 1138 transitions. [2019-01-02 00:06:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:06:28,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 1138 transitions. [2019-01-02 00:06:28,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:06:28,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 700 states and 1138 transitions. [2019-01-02 00:06:28,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 567 [2019-01-02 00:06:28,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 567 [2019-01-02 00:06:28,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 700 states and 1138 transitions. [2019-01-02 00:06:28,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:28,824 INFO L705 BuchiCegarLoop]: Abstraction has 700 states and 1138 transitions. [2019-01-02 00:06:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states and 1138 transitions. [2019-01-02 00:06:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 480. [2019-01-02 00:06:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-02 00:06:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 782 transitions. [2019-01-02 00:06:28,837 INFO L728 BuchiCegarLoop]: Abstraction has 480 states and 782 transitions. [2019-01-02 00:06:28,837 INFO L608 BuchiCegarLoop]: Abstraction has 480 states and 782 transitions. [2019-01-02 00:06:28,837 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:06:28,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 782 transitions. [2019-01-02 00:06:28,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2019-01-02 00:06:28,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:28,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:28,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:28,843 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] [2019-01-02 00:06:28,844 INFO L794 eck$LassoCheckResult]: Stem: 14424#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 14134#L-1 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;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;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; 14135#L116-2 assume !!(add_history_type_~var~0 < 3); 14527#L117 assume 0 == add_history_type_~history_id;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; 14383#L171 assume 0 == read_history_bool_~history_id; 14384#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14105#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 14366#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 14367#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; 14547#L116-2 assume !(add_history_type_~var~0 < 3); 14544#L116-3 add_history_type_#res := 1; 14397#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 14398#L255 assume !(0 == init_~tmp~1);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; 14515#L116-6 assume !!(add_history_type_~var~0 < 3); 14511#L117-2 assume !(0 == add_history_type_~history_id); 14512#L123-2 assume 1 == add_history_type_~history_id;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; 14545#L171-4 assume 0 == read_history_bool_~history_id; 14509#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14153#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14199#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14166#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 14392#L259 assume !(0 == init_~tmp___0~1);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; 14393#L116-10 assume !!(add_history_type_~var~0 < 3); 14503#L117-4 assume !(0 == add_history_type_~history_id); 14504#L123-4 assume 1 == add_history_type_~history_id;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; 14559#L171-7 assume 0 == read_history_bool_~history_id; 14498#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14265#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14190#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14157#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14116#L263 assume !(0 == init_~tmp___1~1);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; 14117#L116-14 assume !!(add_history_type_~var~0 < 3); 14494#L117-6 assume !(0 == add_history_type_~history_id); 14496#L123-6 assume 1 == add_history_type_~history_id;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; 14553#L171-10 assume 0 == read_history_bool_~history_id; 14520#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14240#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14178#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14145#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 14425#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 14395#L270 main_#t~ret57 := init_#res;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; 14206#L550-2 [2019-01-02 00:06:28,844 INFO L796 eck$LassoCheckResult]: Loop: 14206#L550-2 assume !!(main_~i2~0 < 10);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;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; 14390#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; 14331#L570-16 assume 0 != ~gate1Failed~0 % 256; 14333#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 14389#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; 14396#L409 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;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; 14381#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; 14283#L570-17 assume 0 != ~gate2Failed~0 % 256; 14285#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14243#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; 14211#L440 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;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; 14436#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; 14287#L570-18 assume 0 != ~gate3Failed~0 % 256; 14289#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 14501#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; 14502#L471 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; 14522#L486 assume ~VALUE1~0 == ~VALUE2~0; 14524#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 14183#L570-19 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; 14292#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; 14262#L570-20 ~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;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; 14299#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 14419#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 14548#L171-12 assume 0 == read_history_bool_~history_id; 14517#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14301#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14149#L307 assume !(0 == check_~tmp___3~0 % 256); 14150#L307-1 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; 14161#L151-7 assume 3 == read_history_int8_~history_id; 14257#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14258#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14263#L346 assume !(check_~tmp___10~0 > -2); 14471#L346-1 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; 14472#L151-9 assume 3 == read_history_int8_~history_id; 14245#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14236#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14248#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14338#L366-1 check_#res := 1; 14312#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14313#L575-72 assume !(0 == assert_~arg % 256); 14205#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 14206#L550-2 [2019-01-02 00:06:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 1 times [2019-01-02 00:06:28,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:28,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:28,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:29,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:29,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:06:29,068 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:29,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:29,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1417533931, now seen corresponding path program 2 times [2019-01-02 00:06:29,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:29,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:29,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:29,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:29,145 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:29,145 INFO L87 Difference]: Start difference. First operand 480 states and 782 transitions. cyclomatic complexity: 307 Second operand 3 states. [2019-01-02 00:06:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:29,324 INFO L93 Difference]: Finished difference Result 491 states and 796 transitions. [2019-01-02 00:06:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:29,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 491 states and 796 transitions. [2019-01-02 00:06:29,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 223 [2019-01-02 00:06:29,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 491 states to 491 states and 796 transitions. [2019-01-02 00:06:29,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2019-01-02 00:06:29,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2019-01-02 00:06:29,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 491 states and 796 transitions. [2019-01-02 00:06:29,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:29,332 INFO L705 BuchiCegarLoop]: Abstraction has 491 states and 796 transitions. [2019-01-02 00:06:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states and 796 transitions. [2019-01-02 00:06:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 480. [2019-01-02 00:06:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-02 00:06:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 780 transitions. [2019-01-02 00:06:29,345 INFO L728 BuchiCegarLoop]: Abstraction has 480 states and 780 transitions. [2019-01-02 00:06:29,346 INFO L608 BuchiCegarLoop]: Abstraction has 480 states and 780 transitions. [2019-01-02 00:06:29,346 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:06:29,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 780 transitions. [2019-01-02 00:06:29,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2019-01-02 00:06:29,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:29,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:29,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:29,355 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] [2019-01-02 00:06:29,355 INFO L794 eck$LassoCheckResult]: Stem: 15404#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 15114#L-1 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;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;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; 15115#L116-2 assume !!(add_history_type_~var~0 < 3); 15507#L117 assume 0 == add_history_type_~history_id;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; 15363#L171 assume 0 == read_history_bool_~history_id; 15364#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15085#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 15346#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 15347#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; 15527#L116-2 assume !(add_history_type_~var~0 < 3); 15524#L116-3 add_history_type_#res := 1; 15377#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15378#L255 assume !(0 == init_~tmp~1);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; 15495#L116-6 assume !!(add_history_type_~var~0 < 3); 15491#L117-2 assume !(0 == add_history_type_~history_id); 15492#L123-2 assume 1 == add_history_type_~history_id;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; 15525#L171-4 assume 0 == read_history_bool_~history_id; 15489#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15133#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15179#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15146#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15372#L259 assume !(0 == init_~tmp___0~1);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; 15373#L116-10 assume !!(add_history_type_~var~0 < 3); 15483#L117-4 assume !(0 == add_history_type_~history_id); 15484#L123-4 assume 1 == add_history_type_~history_id;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; 15538#L171-7 assume 0 == read_history_bool_~history_id; 15478#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15245#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15170#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15137#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15096#L263 assume !(0 == init_~tmp___1~1);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; 15097#L116-14 assume !!(add_history_type_~var~0 < 3); 15474#L117-6 assume !(0 == add_history_type_~history_id); 15475#L123-6 assume 1 == add_history_type_~history_id;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; 15532#L171-10 assume 0 == read_history_bool_~history_id; 15500#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15220#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15158#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15125#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15405#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 15375#L270 main_#t~ret57 := init_#res;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; 15186#L550-2 [2019-01-02 00:06:29,362 INFO L796 eck$LassoCheckResult]: Loop: 15186#L550-2 assume !!(main_~i2~0 < 10);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;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; 15370#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; 15311#L570-16 assume 0 != ~gate1Failed~0 % 256; 15313#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15369#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; 15376#L409 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;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; 15361#L226-2 assume !(0 == write_history_bool_~history_id); 15362#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; 15263#L570-17 assume 0 != ~gate2Failed~0 % 256; 15265#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15223#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; 15191#L440 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;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; 15416#L226-4 assume !(0 == write_history_bool_~history_id); 15406#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; 15267#L570-18 assume 0 != ~gate3Failed~0 % 256; 15269#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15481#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; 15482#L471 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; 15502#L486 assume ~VALUE1~0 == ~VALUE2~0; 15504#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 15163#L570-19 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; 15272#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; 15242#L570-20 ~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;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; 15279#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 15399#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 15528#L171-12 assume 0 == read_history_bool_~history_id; 15497#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15281#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15129#L307 assume !(0 == check_~tmp___3~0 % 256); 15130#L307-1 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; 15141#L151-7 assume 3 == read_history_int8_~history_id; 15237#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15238#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15243#L346 assume !(check_~tmp___10~0 > -2); 15451#L346-1 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; 15452#L151-9 assume 3 == read_history_int8_~history_id; 15225#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15216#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15228#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 15318#L366-1 check_#res := 1; 15292#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 15293#L575-72 assume !(0 == assert_~arg % 256); 15185#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 15186#L550-2 [2019-01-02 00:06:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 2 times [2019-01-02 00:06:29,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:29,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:29,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:29,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:06:29,494 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1312957580, now seen corresponding path program 1 times [2019-01-02 00:06:29,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:29,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:29,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:29,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:29,522 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:06:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:06:29,523 INFO L87 Difference]: Start difference. First operand 480 states and 780 transitions. cyclomatic complexity: 305 Second operand 5 states. [2019-01-02 00:06:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:29,859 INFO L93 Difference]: Finished difference Result 986 states and 1523 transitions. [2019-01-02 00:06:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-02 00:06:29,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 986 states and 1523 transitions. [2019-01-02 00:06:29,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 632 [2019-01-02 00:06:29,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 986 states to 986 states and 1523 transitions. [2019-01-02 00:06:29,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 821 [2019-01-02 00:06:29,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 821 [2019-01-02 00:06:29,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 986 states and 1523 transitions. [2019-01-02 00:06:29,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:29,873 INFO L705 BuchiCegarLoop]: Abstraction has 986 states and 1523 transitions. [2019-01-02 00:06:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states and 1523 transitions. [2019-01-02 00:06:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 448. [2019-01-02 00:06:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-02 00:06:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 700 transitions. [2019-01-02 00:06:29,883 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 700 transitions. [2019-01-02 00:06:29,883 INFO L608 BuchiCegarLoop]: Abstraction has 448 states and 700 transitions. [2019-01-02 00:06:29,883 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:06:29,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 448 states and 700 transitions. [2019-01-02 00:06:29,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 205 [2019-01-02 00:06:29,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:29,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:29,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:29,887 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] [2019-01-02 00:06:29,887 INFO L794 eck$LassoCheckResult]: Stem: 16884#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 16598#L-1 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;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;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; 16599#L116-2 assume !!(add_history_type_~var~0 < 3); 16962#L117 assume 0 == add_history_type_~history_id;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; 16843#L171 assume 0 == read_history_bool_~history_id; 16844#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16572#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16826#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16827#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; 16979#L116-2 assume !(add_history_type_~var~0 < 3); 16976#L116-3 add_history_type_#res := 1; 16858#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16859#L255 assume !(0 == init_~tmp~1);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; 16957#L116-6 assume !!(add_history_type_~var~0 < 3); 16953#L117-2 assume !(0 == add_history_type_~history_id); 16954#L123-2 assume 1 == add_history_type_~history_id;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; 16977#L171-4 assume !(0 == read_history_bool_~history_id); 16897#L181-4 assume 1 == read_history_bool_~history_id; 16898#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16804#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16657#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16622#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16852#L259 assume !(0 == init_~tmp___0~1);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; 16853#L116-10 assume !!(add_history_type_~var~0 < 3); 16949#L117-4 assume !(0 == add_history_type_~history_id); 16950#L123-4 assume 1 == add_history_type_~history_id;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; 16991#L171-7 assume !(0 == read_history_bool_~history_id); 16923#L181-7 assume 1 == read_history_bool_~history_id; 16924#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16725#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16648#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16613#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 16580#L263 assume !(0 == init_~tmp___1~1);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; 16581#L116-14 assume !!(add_history_type_~var~0 < 3); 16942#L117-6 assume !(0 == add_history_type_~history_id); 16943#L123-6 assume 1 == add_history_type_~history_id;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; 16985#L171-10 assume !(0 == read_history_bool_~history_id); 16911#L181-10 assume 1 == read_history_bool_~history_id; 16912#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16696#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16636#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16605#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16885#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 16855#L270 main_#t~ret57 := init_#res;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; 16662#L550-2 [2019-01-02 00:06:29,888 INFO L796 eck$LassoCheckResult]: Loop: 16662#L550-2 assume !!(main_~i2~0 < 10);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;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; 16850#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; 16789#L570-16 assume 0 != ~gate1Failed~0 % 256; 16791#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16849#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; 16856#L409 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;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; 16841#L226-2 assume !(0 == write_history_bool_~history_id); 16842#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; 16742#L570-17 assume 0 != ~gate2Failed~0 % 256; 16744#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 16699#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; 16667#L440 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;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; 16896#L226-4 assume !(0 == write_history_bool_~history_id); 16886#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; 16745#L570-18 assume 0 != ~gate3Failed~0 % 256; 16747#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 16947#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; 16948#L471 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; 16959#L486 assume ~VALUE1~0 == ~VALUE2~0; 16961#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 16639#L570-19 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; 16752#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; 16718#L570-20 ~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;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; 16759#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 16879#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 16980#L171-12 assume 0 == read_history_bool_~history_id; 16958#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16761#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 16609#L307 assume !(0 == check_~tmp___3~0 % 256); 16610#L307-1 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; 16617#L151-7 assume 3 == read_history_int8_~history_id; 16714#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16715#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 16719#L346 assume !(check_~tmp___10~0 > -2); 16931#L346-1 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; 16932#L151-9 assume 3 == read_history_int8_~history_id; 16701#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16692#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 16704#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 16794#L366-1 check_#res := 1; 16770#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 16771#L575-72 assume !(0 == assert_~arg % 256); 16661#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 16662#L550-2 [2019-01-02 00:06:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 1 times [2019-01-02 00:06:29,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:29,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:06:29,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1312957580, now seen corresponding path program 2 times [2019-01-02 00:06:29,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:29,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:29,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:29,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:30,003 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:30,003 INFO L87 Difference]: Start difference. First operand 448 states and 700 transitions. cyclomatic complexity: 257 Second operand 3 states. [2019-01-02 00:06:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:30,061 INFO L93 Difference]: Finished difference Result 469 states and 730 transitions. [2019-01-02 00:06:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:30,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 730 transitions. [2019-01-02 00:06:30,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2019-01-02 00:06:30,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 469 states and 730 transitions. [2019-01-02 00:06:30,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2019-01-02 00:06:30,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2019-01-02 00:06:30,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 730 transitions. [2019-01-02 00:06:30,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:30,069 INFO L705 BuchiCegarLoop]: Abstraction has 469 states and 730 transitions. [2019-01-02 00:06:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 730 transitions. [2019-01-02 00:06:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 448. [2019-01-02 00:06:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-02 00:06:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 699 transitions. [2019-01-02 00:06:30,079 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 699 transitions. [2019-01-02 00:06:30,079 INFO L608 BuchiCegarLoop]: Abstraction has 448 states and 699 transitions. [2019-01-02 00:06:30,079 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:06:30,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 448 states and 699 transitions. [2019-01-02 00:06:30,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 205 [2019-01-02 00:06:30,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:30,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:30,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:30,083 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] [2019-01-02 00:06:30,083 INFO L794 eck$LassoCheckResult]: Stem: 17809#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 17523#L-1 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;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;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; 17524#L116-2 assume !!(add_history_type_~var~0 < 3); 17887#L117 assume 0 == add_history_type_~history_id;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; 17768#L171 assume 0 == read_history_bool_~history_id; 17769#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17497#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17751#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17752#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; 17904#L116-2 assume !(add_history_type_~var~0 < 3); 17901#L116-3 add_history_type_#res := 1; 17783#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17784#L255 assume !(0 == init_~tmp~1);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; 17882#L116-6 assume !!(add_history_type_~var~0 < 3); 17878#L117-2 assume !(0 == add_history_type_~history_id); 17879#L123-2 assume 1 == add_history_type_~history_id;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; 17902#L171-4 assume !(0 == read_history_bool_~history_id); 17822#L181-4 assume 1 == read_history_bool_~history_id; 17823#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17729#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17582#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17547#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17777#L259 assume !(0 == init_~tmp___0~1);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; 17778#L116-10 assume !!(add_history_type_~var~0 < 3); 17874#L117-4 assume !(0 == add_history_type_~history_id); 17875#L123-4 assume 1 == add_history_type_~history_id;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; 17915#L171-7 assume !(0 == read_history_bool_~history_id); 17848#L181-7 assume 1 == read_history_bool_~history_id; 17849#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17650#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17573#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17538#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17505#L263 assume !(0 == init_~tmp___1~1);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; 17506#L116-14 assume !!(add_history_type_~var~0 < 3); 17867#L117-6 assume !(0 == add_history_type_~history_id); 17869#L123-6 assume 1 == add_history_type_~history_id;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; 17909#L171-10 assume !(0 == read_history_bool_~history_id); 17836#L181-10 assume 1 == read_history_bool_~history_id; 17837#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17621#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17561#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17530#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17810#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 17780#L270 main_#t~ret57 := init_#res;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; 17587#L550-2 [2019-01-02 00:06:30,083 INFO L796 eck$LassoCheckResult]: Loop: 17587#L550-2 assume !!(main_~i2~0 < 10);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;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; 17775#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; 17714#L570-16 assume 0 != ~gate1Failed~0 % 256; 17716#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17774#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; 17781#L409 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;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; 17766#L226-2 assume !(0 == write_history_bool_~history_id); 17767#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; 17667#L570-17 assume 0 != ~gate2Failed~0 % 256; 17669#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17624#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; 17592#L440 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;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; 17821#L226-4 assume !(0 == write_history_bool_~history_id); 17811#L231-4 assume !(1 == write_history_bool_~history_id); 17812#L236-4 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; 17670#L570-18 assume 0 != ~gate3Failed~0 % 256; 17672#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17872#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; 17873#L471 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; 17884#L486 assume ~VALUE1~0 == ~VALUE2~0; 17886#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 17564#L570-19 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; 17677#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; 17643#L570-20 ~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;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; 17684#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 17804#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 17905#L171-12 assume 0 == read_history_bool_~history_id; 17883#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17686#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17534#L307 assume !(0 == check_~tmp___3~0 % 256); 17535#L307-1 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; 17542#L151-7 assume 3 == read_history_int8_~history_id; 17639#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17640#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17644#L346 assume !(check_~tmp___10~0 > -2); 17856#L346-1 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; 17857#L151-9 assume 3 == read_history_int8_~history_id; 17626#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17617#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17629#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17719#L366-1 check_#res := 1; 17695#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17696#L575-72 assume !(0 == assert_~arg % 256); 17586#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 17587#L550-2 [2019-01-02 00:06:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 2 times [2019-01-02 00:06:30,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:30,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:30,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:30,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:30,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:30,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:06:30,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash 456187534, now seen corresponding path program 1 times [2019-01-02 00:06:30,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:30,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:30,328 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:30,329 INFO L87 Difference]: Start difference. First operand 448 states and 699 transitions. cyclomatic complexity: 256 Second operand 3 states. [2019-01-02 00:06:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:30,439 INFO L93 Difference]: Finished difference Result 638 states and 999 transitions. [2019-01-02 00:06:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:30,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 638 states and 999 transitions. [2019-01-02 00:06:30,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2019-01-02 00:06:30,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 638 states to 638 states and 999 transitions. [2019-01-02 00:06:30,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 517 [2019-01-02 00:06:30,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 517 [2019-01-02 00:06:30,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 638 states and 999 transitions. [2019-01-02 00:06:30,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:30,450 INFO L705 BuchiCegarLoop]: Abstraction has 638 states and 999 transitions. [2019-01-02 00:06:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states and 999 transitions. [2019-01-02 00:06:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 490. [2019-01-02 00:06:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-01-02 00:06:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 762 transitions. [2019-01-02 00:06:30,463 INFO L728 BuchiCegarLoop]: Abstraction has 490 states and 762 transitions. [2019-01-02 00:06:30,463 INFO L608 BuchiCegarLoop]: Abstraction has 490 states and 762 transitions. [2019-01-02 00:06:30,464 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:06:30,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 490 states and 762 transitions. [2019-01-02 00:06:30,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2019-01-02 00:06:30,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:30,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:30,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:30,468 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] [2019-01-02 00:06:30,468 INFO L794 eck$LassoCheckResult]: Stem: 18908#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 18617#L-1 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;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;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; 18618#L116-2 assume !!(add_history_type_~var~0 < 3); 18988#L117 assume 0 == add_history_type_~history_id;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; 18866#L171 assume 0 == read_history_bool_~history_id; 18867#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18591#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18849#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18850#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; 19005#L116-2 assume !(add_history_type_~var~0 < 3); 19002#L116-3 add_history_type_#res := 1; 18881#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18882#L255 assume !(0 == init_~tmp~1);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; 18982#L116-6 assume !!(add_history_type_~var~0 < 3); 18978#L117-2 assume !(0 == add_history_type_~history_id); 18979#L123-2 assume 1 == add_history_type_~history_id;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; 19003#L171-4 assume !(0 == read_history_bool_~history_id); 18922#L181-4 assume 1 == read_history_bool_~history_id; 18923#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18827#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18676#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18641#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18875#L259 assume !(0 == init_~tmp___0~1);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; 18876#L116-10 assume !!(add_history_type_~var~0 < 3); 18974#L117-4 assume !(0 == add_history_type_~history_id); 18975#L123-4 assume 1 == add_history_type_~history_id;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; 19019#L171-7 assume !(0 == read_history_bool_~history_id); 18948#L181-7 assume 1 == read_history_bool_~history_id; 18949#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18744#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18667#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18632#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18599#L263 assume !(0 == init_~tmp___1~1);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; 18600#L116-14 assume !!(add_history_type_~var~0 < 3); 18967#L117-6 assume !(0 == add_history_type_~history_id); 18969#L123-6 assume 1 == add_history_type_~history_id;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; 19013#L171-10 assume !(0 == read_history_bool_~history_id); 18936#L181-10 assume 1 == read_history_bool_~history_id; 18937#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18715#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18655#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18624#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18909#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 18878#L270 main_#t~ret57 := init_#res;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; 18681#L550-2 [2019-01-02 00:06:30,468 INFO L796 eck$LassoCheckResult]: Loop: 18681#L550-2 assume !!(main_~i2~0 < 10);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;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; 18873#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; 18812#L570-16 assume 0 != ~gate1Failed~0 % 256; 18814#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18872#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; 18879#L409 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;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; 18864#L226-2 assume !(0 == write_history_bool_~history_id); 18865#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; 18761#L570-17 assume 0 != ~gate2Failed~0 % 256; 18763#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18779#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; 18920#L440 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;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; 18921#L226-4 assume !(0 == write_history_bool_~history_id); 19065#L231-4 assume !(1 == write_history_bool_~history_id); 19064#L236-4 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; 18764#L570-18 assume 0 != ~gate3Failed~0 % 256; 18766#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 18987#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; 19058#L471 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; 19057#L486 assume ~VALUE1~0 == ~VALUE2~0; 19042#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 18658#L570-19 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; 18772#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; 18737#L570-20 ~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;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; 18780#L294 assume !(0 == ~gate1Failed~0 % 256); 18902#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 18903#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 19008#L171-12 assume 0 == read_history_bool_~history_id; 18983#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18782#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18628#L307 assume !(0 == check_~tmp___3~0 % 256); 18629#L307-1 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; 18636#L151-7 assume 3 == read_history_int8_~history_id; 18733#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18734#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18738#L346 assume !(check_~tmp___10~0 > -2); 18956#L346-1 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; 18957#L151-9 assume 3 == read_history_int8_~history_id; 18720#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18711#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18723#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18817#L366-1 check_#res := 1; 18792#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18793#L575-72 assume !(0 == assert_~arg % 256); 18680#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 18681#L550-2 [2019-01-02 00:06:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 3 times [2019-01-02 00:06:30,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:30,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:30,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:06:30,629 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1361249562, now seen corresponding path program 1 times [2019-01-02 00:06:30,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:30,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:30,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:30,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:06:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:06:30,706 INFO L87 Difference]: Start difference. First operand 490 states and 762 transitions. cyclomatic complexity: 277 Second operand 4 states. [2019-01-02 00:06:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:31,152 INFO L93 Difference]: Finished difference Result 744 states and 1157 transitions. [2019-01-02 00:06:31,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:06:31,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 744 states and 1157 transitions. [2019-01-02 00:06:31,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 494 [2019-01-02 00:06:31,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 744 states to 709 states and 1104 transitions. [2019-01-02 00:06:31,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 588 [2019-01-02 00:06:31,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 588 [2019-01-02 00:06:31,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 709 states and 1104 transitions. [2019-01-02 00:06:31,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:31,164 INFO L705 BuchiCegarLoop]: Abstraction has 709 states and 1104 transitions. [2019-01-02 00:06:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states and 1104 transitions. [2019-01-02 00:06:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 457. [2019-01-02 00:06:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-01-02 00:06:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 710 transitions. [2019-01-02 00:06:31,174 INFO L728 BuchiCegarLoop]: Abstraction has 457 states and 710 transitions. [2019-01-02 00:06:31,175 INFO L608 BuchiCegarLoop]: Abstraction has 457 states and 710 transitions. [2019-01-02 00:06:31,175 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:06:31,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 457 states and 710 transitions. [2019-01-02 00:06:31,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2019-01-02 00:06:31,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:31,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:31,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:31,178 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] [2019-01-02 00:06:31,179 INFO L794 eck$LassoCheckResult]: Stem: 20128#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 19861#L-1 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;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;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; 19862#L116-2 assume !!(add_history_type_~var~0 < 3); 20199#L117 assume 0 == add_history_type_~history_id;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; 20087#L171 assume 0 == read_history_bool_~history_id; 20088#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 19835#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 20073#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 20074#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; 20214#L116-2 assume !(add_history_type_~var~0 < 3); 20212#L116-3 add_history_type_#res := 1; 20102#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 20103#L255 assume !(0 == init_~tmp~1);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; 20194#L116-6 assume !!(add_history_type_~var~0 < 3); 20192#L117-2 assume !(0 == add_history_type_~history_id); 20193#L123-2 assume !(1 == add_history_type_~history_id); 20246#L129-2 assume !(2 == add_history_type_~history_id); 20236#L135-3 assume !(3 == add_history_type_~history_id); 19885#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; 20226#L116-6 assume !(add_history_type_~var~0 < 3); 20223#L116-7 add_history_type_#res := 1; 20132#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 20096#L259 assume !(0 == init_~tmp___0~1);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; 20097#L116-10 assume !!(add_history_type_~var~0 < 3); 20188#L117-4 assume !(0 == add_history_type_~history_id); 20190#L123-4 assume 1 == add_history_type_~history_id;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; 20227#L171-7 assume !(0 == read_history_bool_~history_id); 20162#L181-7 assume 1 == read_history_bool_~history_id; 20163#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19979#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19903#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19877#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19843#L263 assume !(0 == init_~tmp___1~1);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; 19844#L116-14 assume !!(add_history_type_~var~0 < 3); 20181#L117-6 assume !(0 == add_history_type_~history_id); 20183#L123-6 assume 1 == add_history_type_~history_id;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; 20221#L171-10 assume !(0 == read_history_bool_~history_id); 20150#L181-10 assume 1 == read_history_bool_~history_id; 20151#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19953#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19894#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19871#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 20129#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 20099#L270 main_#t~ret57 := init_#res;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; 19916#L550-2 [2019-01-02 00:06:31,179 INFO L796 eck$LassoCheckResult]: Loop: 19916#L550-2 assume !!(main_~i2~0 < 10);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;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; 20094#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; 20041#L570-16 assume 0 != ~gate1Failed~0 % 256; 20043#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 20093#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; 20100#L409 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;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; 20085#L226-2 assume !(0 == write_history_bool_~history_id); 20086#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; 19994#L570-17 assume 0 != ~gate2Failed~0 % 256; 19996#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 19956#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; 19921#L440 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;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; 20138#L226-4 assume !(0 == write_history_bool_~history_id); 20130#L231-4 assume !(1 == write_history_bool_~history_id); 20131#L236-4 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; 19998#L570-18 assume 0 != ~gate3Failed~0 % 256; 20000#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 20186#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; 20187#L471 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; 20196#L486 assume ~VALUE1~0 == ~VALUE2~0; 20198#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 19897#L570-19 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; 20002#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; 19972#L570-20 ~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;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; 20009#L294 assume !(0 == ~gate1Failed~0 % 256); 20122#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 20123#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 20216#L171-12 assume 0 == read_history_bool_~history_id; 20195#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 20011#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19867#L307 assume !(0 == check_~tmp___3~0 % 256); 19868#L307-1 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; 19875#L151-7 assume 3 == read_history_int8_~history_id; 19963#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19964#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 19973#L346 assume !(check_~tmp___10~0 > -2); 20169#L346-1 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; 20170#L151-9 assume 3 == read_history_int8_~history_id; 19950#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19946#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 19958#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 20046#L366-1 check_#res := 1; 20022#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 20023#L575-72 assume !(0 == assert_~arg % 256); 19915#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 19916#L550-2 [2019-01-02 00:06:31,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2106629905, now seen corresponding path program 1 times [2019-01-02 00:06:31,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:31,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:31,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:31,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:06:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:31,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:31,252 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1361249562, now seen corresponding path program 2 times [2019-01-02 00:06:31,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:31,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:31,320 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:31,321 INFO L87 Difference]: Start difference. First operand 457 states and 710 transitions. cyclomatic complexity: 258 Second operand 3 states. [2019-01-02 00:06:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:31,429 INFO L93 Difference]: Finished difference Result 705 states and 1090 transitions. [2019-01-02 00:06:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:31,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 1090 transitions. [2019-01-02 00:06:31,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 494 [2019-01-02 00:06:31,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 705 states and 1090 transitions. [2019-01-02 00:06:31,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2019-01-02 00:06:31,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2019-01-02 00:06:31,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 1090 transitions. [2019-01-02 00:06:31,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:31,442 INFO L705 BuchiCegarLoop]: Abstraction has 705 states and 1090 transitions. [2019-01-02 00:06:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 1090 transitions. [2019-01-02 00:06:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 447. [2019-01-02 00:06:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-02 00:06:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 690 transitions. [2019-01-02 00:06:31,453 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 690 transitions. [2019-01-02 00:06:31,453 INFO L608 BuchiCegarLoop]: Abstraction has 447 states and 690 transitions. [2019-01-02 00:06:31,453 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:06:31,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 690 transitions. [2019-01-02 00:06:31,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2019-01-02 00:06:31,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:31,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:31,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:31,460 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] [2019-01-02 00:06:31,460 INFO L794 eck$LassoCheckResult]: Stem: 21287#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 21030#L-1 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;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;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; 21031#L116-2 assume !!(add_history_type_~var~0 < 3); 21359#L117 assume 0 == add_history_type_~history_id;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; 21246#L171 assume 0 == read_history_bool_~history_id; 21247#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21004#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 21235#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 21236#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; 21373#L116-2 assume !(add_history_type_~var~0 < 3); 21371#L116-3 add_history_type_#res := 1; 21261#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21262#L255 assume !(0 == init_~tmp~1);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; 21354#L116-6 assume !!(add_history_type_~var~0 < 3); 21352#L117-2 assume !(0 == add_history_type_~history_id); 21353#L123-2 assume 1 == add_history_type_~history_id;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; 21372#L171-4 assume !(0 == read_history_bool_~history_id); 21295#L181-4 assume 1 == read_history_bool_~history_id; 21296#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21219#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21080#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 21081#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; 21385#L116-6 assume !(add_history_type_~var~0 < 3); 21382#L116-7 add_history_type_#res := 1; 21291#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21256#L259 assume !(0 == init_~tmp___0~1);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; 21257#L116-10 assume !!(add_history_type_~var~0 < 3); 21346#L117-4 assume !(0 == add_history_type_~history_id); 21348#L123-4 assume 1 == add_history_type_~history_id;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; 21386#L171-7 assume !(0 == read_history_bool_~history_id); 21318#L181-7 assume 1 == read_history_bool_~history_id; 21319#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21146#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21068#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21046#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 21012#L263 assume !(0 == init_~tmp___1~1);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; 21013#L116-14 assume !!(add_history_type_~var~0 < 3); 21337#L117-6 assume !(0 == add_history_type_~history_id); 21339#L123-6 assume 1 == add_history_type_~history_id;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; 21380#L171-10 assume !(0 == read_history_bool_~history_id); 21306#L181-10 assume 1 == read_history_bool_~history_id; 21307#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21121#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21058#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21037#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21288#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 21258#L270 main_#t~ret57 := init_#res;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; 21083#L550-2 [2019-01-02 00:06:31,461 INFO L796 eck$LassoCheckResult]: Loop: 21083#L550-2 assume !!(main_~i2~0 < 10);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;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; 21253#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; 21206#L570-16 assume 0 != ~gate1Failed~0 % 256; 21208#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 21252#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; 21259#L409 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;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; 21244#L226-2 assume !(0 == write_history_bool_~history_id); 21245#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; 21158#L570-17 assume 0 != ~gate2Failed~0 % 256; 21160#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 21116#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; 21088#L440 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;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; 21294#L226-4 assume !(0 == write_history_bool_~history_id); 21289#L231-4 assume !(1 == write_history_bool_~history_id); 21290#L236-4 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; 21162#L570-18 assume 0 != ~gate3Failed~0 % 256; 21164#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21344#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; 21345#L471 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; 21356#L486 assume ~VALUE1~0 == ~VALUE2~0; 21358#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 21062#L570-19 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; 21167#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; 21139#L570-20 ~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;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; 21174#L294 assume !(0 == ~gate1Failed~0 % 256); 21281#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 21282#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 21375#L171-12 assume 0 == read_history_bool_~history_id; 21355#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21176#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 21041#L307 assume !(0 == check_~tmp___3~0 % 256); 21042#L307-1 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; 21044#L151-7 assume 3 == read_history_int8_~history_id; 21130#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21131#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 21140#L346 assume !(check_~tmp___10~0 > -2); 21325#L346-1 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; 21326#L151-9 assume 3 == read_history_int8_~history_id; 21118#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21113#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 21125#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 21211#L366-1 check_#res := 1; 21187#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21188#L575-72 assume !(0 == assert_~arg % 256); 21082#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 21083#L550-2 [2019-01-02 00:06:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 1 times [2019-01-02 00:06:31,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:31,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:06:31,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:31,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:31,569 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1361249562, now seen corresponding path program 3 times [2019-01-02 00:06:31,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:31,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:31,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:31,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:31,673 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:31,674 INFO L87 Difference]: Start difference. First operand 447 states and 690 transitions. cyclomatic complexity: 250 Second operand 3 states. [2019-01-02 00:06:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:31,797 INFO L93 Difference]: Finished difference Result 667 states and 1036 transitions. [2019-01-02 00:06:31,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:31,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 667 states and 1036 transitions. [2019-01-02 00:06:31,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 467 [2019-01-02 00:06:31,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 667 states to 667 states and 1036 transitions. [2019-01-02 00:06:31,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 558 [2019-01-02 00:06:31,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2019-01-02 00:06:31,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 1036 transitions. [2019-01-02 00:06:31,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:31,815 INFO L705 BuchiCegarLoop]: Abstraction has 667 states and 1036 transitions. [2019-01-02 00:06:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 1036 transitions. [2019-01-02 00:06:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 504. [2019-01-02 00:06:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-02 00:06:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 776 transitions. [2019-01-02 00:06:31,828 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 776 transitions. [2019-01-02 00:06:31,828 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 776 transitions. [2019-01-02 00:06:31,828 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-02 00:06:31,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 776 transitions. [2019-01-02 00:06:31,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-02 00:06:31,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:31,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:31,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:31,839 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] [2019-01-02 00:06:31,840 INFO L794 eck$LassoCheckResult]: Stem: 22409#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 22151#L-1 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;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;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; 22152#L116-2 assume !!(add_history_type_~var~0 < 3); 22482#L117 assume 0 == add_history_type_~history_id;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; 22369#L171 assume 0 == read_history_bool_~history_id; 22370#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22125#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22358#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22359#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; 22497#L116-2 assume !(add_history_type_~var~0 < 3); 22495#L116-3 add_history_type_#res := 1; 22384#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22385#L255 assume !(0 == init_~tmp~1);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; 22477#L116-6 assume !!(add_history_type_~var~0 < 3); 22475#L117-2 assume !(0 == add_history_type_~history_id); 22476#L123-2 assume 1 == add_history_type_~history_id;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; 22496#L171-4 assume !(0 == read_history_bool_~history_id); 22417#L181-4 assume 1 == read_history_bool_~history_id; 22418#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22346#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22201#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 22202#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; 22508#L116-6 assume !(add_history_type_~var~0 < 3); 22505#L116-7 add_history_type_#res := 1; 22413#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22379#L259 assume !(0 == init_~tmp___0~1);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; 22380#L116-10 assume !!(add_history_type_~var~0 < 3); 22469#L117-4 assume !(0 == add_history_type_~history_id); 22471#L123-4 assume 1 == add_history_type_~history_id;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; 22509#L171-7 assume !(0 == read_history_bool_~history_id); 22440#L181-7 assume 1 == read_history_bool_~history_id; 22441#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22264#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22184#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22166#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22133#L263 assume !(0 == init_~tmp___1~1);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; 22134#L116-14 assume !!(add_history_type_~var~0 < 3); 22459#L117-6 assume !(0 == add_history_type_~history_id); 22461#L123-6 assume 1 == add_history_type_~history_id;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; 22503#L171-10 assume !(0 == read_history_bool_~history_id); 22428#L181-10 assume 1 == read_history_bool_~history_id; 22429#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22238#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22177#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22158#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22410#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 22381#L270 main_#t~ret57 := init_#res;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; 22204#L550-2 [2019-01-02 00:06:31,840 INFO L796 eck$LassoCheckResult]: Loop: 22204#L550-2 assume !!(main_~i2~0 < 10);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;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; 22376#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; 22329#L570-16 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; 22330#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 22374#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 22378#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; 22494#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; 22498#L409 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;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; 22367#L226-2 assume !(0 == write_history_bool_~history_id); 22368#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; 22280#L570-17 assume 0 != ~gate2Failed~0 % 256; 22282#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 22241#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; 22242#L440 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;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; 22416#L226-4 assume !(0 == write_history_bool_~history_id); 22411#L231-4 assume !(1 == write_history_bool_~history_id); 22412#L236-4 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; 22284#L570-18 assume 0 != ~gate3Failed~0 % 256; 22286#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 22467#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; 22468#L471 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; 22610#L486 assume ~VALUE1~0 == ~VALUE2~0; 22604#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 22603#L570-19 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; 22529#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; 22261#L570-20 ~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;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; 22535#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 22526#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 22499#L171-12 assume 0 == read_history_bool_~history_id; 22478#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22299#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22162#L307 assume !(0 == check_~tmp___3~0 % 256); 22163#L307-1 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; 22170#L151-7 assume 3 == read_history_int8_~history_id; 22256#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22257#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22262#L346 assume !(check_~tmp___10~0 > -2); 22447#L346-1 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; 22448#L151-9 assume 3 == read_history_int8_~history_id; 22244#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22234#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22247#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22334#L366-1 check_#res := 1; 22310#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22311#L575-72 assume !(0 == assert_~arg % 256); 22203#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 22204#L550-2 [2019-01-02 00:06:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 2 times [2019-01-02 00:06:31,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:31,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:31,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:31,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:06:31,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:31,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:31,947 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2090910731, now seen corresponding path program 1 times [2019-01-02 00:06:31,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:31,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:31,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:32,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:32,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:32,026 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:32,026 INFO L87 Difference]: Start difference. First operand 504 states and 776 transitions. cyclomatic complexity: 279 Second operand 3 states. [2019-01-02 00:06:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:32,489 INFO L93 Difference]: Finished difference Result 767 states and 1131 transitions. [2019-01-02 00:06:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:32,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 767 states and 1131 transitions. [2019-01-02 00:06:32,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-02 00:06:32,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 767 states to 767 states and 1131 transitions. [2019-01-02 00:06:32,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2019-01-02 00:06:32,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2019-01-02 00:06:32,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 1131 transitions. [2019-01-02 00:06:32,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:32,501 INFO L705 BuchiCegarLoop]: Abstraction has 767 states and 1131 transitions. [2019-01-02 00:06:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 1131 transitions. [2019-01-02 00:06:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 504. [2019-01-02 00:06:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-02 00:06:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 748 transitions. [2019-01-02 00:06:32,509 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 748 transitions. [2019-01-02 00:06:32,509 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 748 transitions. [2019-01-02 00:06:32,509 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-02 00:06:32,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 748 transitions. [2019-01-02 00:06:32,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-02 00:06:32,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:32,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:32,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:32,512 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] [2019-01-02 00:06:32,512 INFO L794 eck$LassoCheckResult]: Stem: 23687#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 23429#L-1 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;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;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; 23430#L116-2 assume !!(add_history_type_~var~0 < 3); 23760#L117 assume 0 == add_history_type_~history_id;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; 23647#L171 assume 0 == read_history_bool_~history_id; 23648#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23400#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 23636#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 23637#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; 23775#L116-2 assume !(add_history_type_~var~0 < 3); 23773#L116-3 add_history_type_#res := 1; 23661#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 23662#L255 assume !(0 == init_~tmp~1);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; 23755#L116-6 assume !!(add_history_type_~var~0 < 3); 23753#L117-2 assume !(0 == add_history_type_~history_id); 23754#L123-2 assume 1 == add_history_type_~history_id;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; 23774#L171-4 assume !(0 == read_history_bool_~history_id); 23695#L181-4 assume 1 == read_history_bool_~history_id; 23696#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23618#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23475#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 23476#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; 23785#L116-6 assume !(add_history_type_~var~0 < 3); 23782#L116-7 add_history_type_#res := 1; 23691#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 23656#L259 assume !(0 == init_~tmp___0~1);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; 23657#L116-10 assume !!(add_history_type_~var~0 < 3); 23747#L117-4 assume !(0 == add_history_type_~history_id); 23749#L123-4 assume 1 == add_history_type_~history_id;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; 23786#L171-7 assume !(0 == read_history_bool_~history_id); 23718#L181-7 assume 1 == read_history_bool_~history_id; 23719#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23542#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23465#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23444#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23411#L263 assume !(0 == init_~tmp___1~1);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; 23412#L116-14 assume !!(add_history_type_~var~0 < 3); 23737#L117-6 assume !(0 == add_history_type_~history_id); 23739#L123-6 assume 1 == add_history_type_~history_id;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; 23780#L171-10 assume !(0 == read_history_bool_~history_id); 23706#L181-10 assume 1 == read_history_bool_~history_id; 23707#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23516#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23455#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23436#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 23688#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 23659#L270 main_#t~ret57 := init_#res;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; 23482#L550-2 [2019-01-02 00:06:32,513 INFO L796 eck$LassoCheckResult]: Loop: 23482#L550-2 assume !!(main_~i2~0 < 10);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;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; 23654#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; 23607#L570-16 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; 23608#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 23652#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 23658#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; 23772#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; 23743#L409 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;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; 23645#L226-2 assume !(0 == write_history_bool_~history_id); 23646#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; 23558#L570-17 assume 0 != ~gate2Failed~0 % 256; 23560#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 23888#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; 23885#L440 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;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; 23882#L226-4 assume !(0 == write_history_bool_~history_id); 23880#L231-4 assume !(1 == write_history_bool_~history_id); 23877#L236-4 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; 23873#L570-18 assume 0 != ~gate3Failed~0 % 256; 23871#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 23869#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; 23867#L471 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; 23866#L486 assume ~VALUE1~0 == ~VALUE2~0; 23857#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 23856#L570-19 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; 23855#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; 23850#L570-20 ~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;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; 23807#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 23802#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 23776#L171-12 assume 0 == read_history_bool_~history_id; 23756#L172-12 assume !(0 == read_history_bool_~historyIndex); 23734#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 23577#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23440#L307 assume !(0 == check_~tmp___3~0 % 256); 23441#L307-1 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; 23448#L151-7 assume 3 == read_history_int8_~history_id; 23534#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23535#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 23540#L346 assume !(check_~tmp___10~0 > -2); 23725#L346-1 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; 23726#L151-9 assume 3 == read_history_int8_~history_id; 23522#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23512#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 23525#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 23612#L366-1 check_#res := 1; 23588#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 23589#L575-72 assume !(0 == assert_~arg % 256); 23481#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 23482#L550-2 [2019-01-02 00:06:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:32,513 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 3 times [2019-01-02 00:06:32,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:32,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:32,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:32,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:32,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:06:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:32,575 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 723701399, now seen corresponding path program 1 times [2019-01-02 00:06:32,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:32,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:32,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:32,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:06:32,626 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:32,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:06:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:06:32,627 INFO L87 Difference]: Start difference. First operand 504 states and 748 transitions. cyclomatic complexity: 251 Second operand 4 states. [2019-01-02 00:06:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:33,000 INFO L93 Difference]: Finished difference Result 1384 states and 2038 transitions. [2019-01-02 00:06:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:06:33,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1384 states and 2038 transitions. [2019-01-02 00:06:33,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 561 [2019-01-02 00:06:33,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1384 states to 1384 states and 2038 transitions. [2019-01-02 00:06:33,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1122 [2019-01-02 00:06:33,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1122 [2019-01-02 00:06:33,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1384 states and 2038 transitions. [2019-01-02 00:06:33,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:33,020 INFO L705 BuchiCegarLoop]: Abstraction has 1384 states and 2038 transitions. [2019-01-02 00:06:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states and 2038 transitions. [2019-01-02 00:06:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 504. [2019-01-02 00:06:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-02 00:06:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 747 transitions. [2019-01-02 00:06:33,031 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 747 transitions. [2019-01-02 00:06:33,031 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 747 transitions. [2019-01-02 00:06:33,031 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-02 00:06:33,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 747 transitions. [2019-01-02 00:06:33,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-02 00:06:33,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:33,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:33,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:33,033 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] [2019-01-02 00:06:33,034 INFO L794 eck$LassoCheckResult]: Stem: 25585#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 25328#L-1 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;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;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; 25329#L116-2 assume !!(add_history_type_~var~0 < 3); 25659#L117 assume 0 == add_history_type_~history_id;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; 25545#L171 assume 0 == read_history_bool_~history_id; 25546#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 25302#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 25534#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 25535#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; 25673#L116-2 assume !(add_history_type_~var~0 < 3); 25671#L116-3 add_history_type_#res := 1; 25560#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 25561#L255 assume !(0 == init_~tmp~1);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; 25652#L116-6 assume !!(add_history_type_~var~0 < 3); 25650#L117-2 assume !(0 == add_history_type_~history_id); 25651#L123-2 assume 1 == add_history_type_~history_id;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; 25672#L171-4 assume !(0 == read_history_bool_~history_id); 25593#L181-4 assume 1 == read_history_bool_~history_id; 25594#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25518#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25378#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25379#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; 25685#L116-6 assume !(add_history_type_~var~0 < 3); 25682#L116-7 add_history_type_#res := 1; 25589#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 25554#L259 assume !(0 == init_~tmp___0~1);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; 25555#L116-10 assume !!(add_history_type_~var~0 < 3); 25644#L117-4 assume !(0 == add_history_type_~history_id); 25646#L123-4 assume 1 == add_history_type_~history_id;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; 25686#L171-7 assume !(0 == read_history_bool_~history_id); 25616#L181-7 assume 1 == read_history_bool_~history_id; 25617#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25445#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25366#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25344#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 25310#L263 assume !(0 == init_~tmp___1~1);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; 25311#L116-14 assume !!(add_history_type_~var~0 < 3); 25635#L117-6 assume !(0 == add_history_type_~history_id); 25637#L123-6 assume 1 == add_history_type_~history_id;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; 25680#L171-10 assume !(0 == read_history_bool_~history_id); 25604#L181-10 assume 1 == read_history_bool_~history_id; 25605#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25420#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25356#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25338#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 25586#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 25557#L270 main_#t~ret57 := init_#res;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; 25381#L550-2 [2019-01-02 00:06:33,034 INFO L796 eck$LassoCheckResult]: Loop: 25381#L550-2 assume !!(main_~i2~0 < 10);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;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; 25552#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; 25505#L570-16 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; 25506#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 25550#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 25556#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; 25670#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; 25674#L409 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;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; 25759#L226-2 assume !(0 == write_history_bool_~history_id); 25757#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; 25754#L570-17 assume 0 != ~gate2Failed~0 % 256; 25755#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25787#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; 25786#L440 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;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; 25785#L226-4 assume !(0 == write_history_bool_~history_id); 25784#L231-4 assume !(1 == write_history_bool_~history_id); 25783#L236-4 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; 25781#L570-18 assume 0 != ~gate3Failed~0 % 256; 25657#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 25658#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; 25773#L471 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; 25770#L486 assume ~VALUE1~0 == ~VALUE2~0; 25764#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 25763#L570-19 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; 25762#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; 25760#L570-20 ~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;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; 25709#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 25703#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 25675#L171-12 assume 0 == read_history_bool_~history_id; 25653#L172-12 assume !(0 == read_history_bool_~historyIndex); 25632#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 25475#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 25334#L307 assume !(0 == check_~tmp___3~0 % 256); 25335#L307-1 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; 25342#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 25330#L575-54 assume !(0 == assert_~arg % 256); 25331#L570-27 read_history_int8_#res := -2; 25438#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25439#L346 assume !(check_~tmp___10~0 > -2); 25623#L346-1 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; 25624#L151-9 assume 3 == read_history_int8_~history_id; 25417#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25411#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25424#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 25510#L366-1 check_#res := 1; 25486#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25487#L575-72 assume !(0 == assert_~arg % 256); 25380#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 25381#L550-2 [2019-01-02 00:06:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 4 times [2019-01-02 00:06:33,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:33,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:33,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:33,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:06:33,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:33,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:33,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash -531336648, now seen corresponding path program 1 times [2019-01-02 00:06:33,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:33,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:06:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:06:33,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:33,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:06:33,167 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:06:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:06:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:06:33,168 INFO L87 Difference]: Start difference. First operand 504 states and 747 transitions. cyclomatic complexity: 250 Second operand 3 states. [2019-01-02 00:06:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:06:33,462 INFO L93 Difference]: Finished difference Result 778 states and 1137 transitions. [2019-01-02 00:06:33,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:06:33,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 778 states and 1137 transitions. [2019-01-02 00:06:33,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 608 [2019-01-02 00:06:33,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 778 states to 778 states and 1137 transitions. [2019-01-02 00:06:33,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2019-01-02 00:06:33,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 687 [2019-01-02 00:06:33,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 778 states and 1137 transitions. [2019-01-02 00:06:33,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:06:33,481 INFO L705 BuchiCegarLoop]: Abstraction has 778 states and 1137 transitions. [2019-01-02 00:06:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states and 1137 transitions. [2019-01-02 00:06:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 468. [2019-01-02 00:06:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-01-02 00:06:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 685 transitions. [2019-01-02 00:06:33,494 INFO L728 BuchiCegarLoop]: Abstraction has 468 states and 685 transitions. [2019-01-02 00:06:33,496 INFO L608 BuchiCegarLoop]: Abstraction has 468 states and 685 transitions. [2019-01-02 00:06:33,496 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-02 00:06:33,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 685 transitions. [2019-01-02 00:06:33,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-02 00:06:33,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:06:33,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:06:33,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:06:33,508 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] [2019-01-02 00:06:33,508 INFO L794 eck$LassoCheckResult]: Stem: 26850#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 26617#L-1 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;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;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; 26618#L116-2 assume !!(add_history_type_~var~0 < 3); 26916#L117 assume 0 == add_history_type_~history_id;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; 26810#L171 assume 0 == read_history_bool_~history_id; 26811#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 26588#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 26801#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 26802#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; 26930#L116-2 assume !(add_history_type_~var~0 < 3); 26928#L116-3 add_history_type_#res := 1; 26824#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 26825#L255 assume !(0 == init_~tmp~1);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; 26911#L116-6 assume !!(add_history_type_~var~0 < 3); 26909#L117-2 assume !(0 == add_history_type_~history_id); 26910#L123-2 assume 1 == add_history_type_~history_id;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; 26929#L171-4 assume !(0 == read_history_bool_~history_id); 26858#L181-4 assume 1 == read_history_bool_~history_id; 26859#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26791#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26660#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 26661#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; 26941#L116-6 assume !(add_history_type_~var~0 < 3); 26938#L116-7 add_history_type_#res := 1; 26854#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 26819#L259 assume !(0 == init_~tmp___0~1);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; 26820#L116-10 assume !!(add_history_type_~var~0 < 3); 26905#L117-4 assume !(0 == add_history_type_~history_id); 26907#L123-4 assume !(1 == add_history_type_~history_id); 26949#L129-4 assume 2 == add_history_type_~history_id;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; 26939#L171-8 assume !(0 == read_history_bool_~history_id); 26876#L181-8 assume 1 == read_history_bool_~history_id; 26877#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26710#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 26631#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 26632#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 26599#L263 assume !(0 == init_~tmp___1~1);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; 26600#L116-14 assume !!(add_history_type_~var~0 < 3); 26895#L117-6 assume !(0 == add_history_type_~history_id); 26897#L123-6 assume 1 == add_history_type_~history_id;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; 26936#L171-10 assume !(0 == read_history_bool_~history_id); 26870#L181-10 assume 1 == read_history_bool_~history_id; 26871#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26695#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26643#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 26624#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 26851#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 26822#L270 main_#t~ret57 := init_#res;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; 26667#L550-2 [2019-01-02 00:06:33,509 INFO L796 eck$LassoCheckResult]: Loop: 26667#L550-2 assume !!(main_~i2~0 < 10);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;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; 26817#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; 26784#L570-16 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; 26785#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 26815#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 26821#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; 26927#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; 26901#L409 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;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; 26808#L226-2 assume !(0 == write_history_bool_~history_id); 26809#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; 26733#L570-17 assume 0 != ~gate2Failed~0 % 256; 26735#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27054#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; 27053#L440 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;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; 27052#L226-4 assume !(0 == write_history_bool_~history_id); 27049#L231-4 assume !(1 == write_history_bool_~history_id); 26862#L236-4 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; 26756#L570-18 assume 0 != ~gate3Failed~0 % 256; 27044#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27043#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; 27041#L471 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; 27040#L486 assume ~VALUE1~0 == ~VALUE2~0; 27033#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 27032#L570-19 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; 27031#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; 27029#L570-20 ~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;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; 26962#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 26951#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 26931#L171-12 assume 0 == read_history_bool_~history_id; 26912#L172-12 assume !(0 == read_history_bool_~historyIndex); 26892#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 26752#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 26628#L307 assume !(0 == check_~tmp___3~0 % 256); 26629#L307-1 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; 26636#L151-7 assume 3 == read_history_int8_~history_id; 26713#L152-7 assume !(0 == read_history_int8_~historyIndex); 26714#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 26718#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 26719#L346 assume !(check_~tmp___10~0 > -2); 26883#L346-1 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; 26884#L151-9 assume 3 == read_history_int8_~history_id; 26701#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 26691#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 26704#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 26789#L366-1 check_#res := 1; 26764#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 26765#L575-72 assume !(0 == assert_~arg % 256); 26666#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 26667#L550-2 [2019-01-02 00:06:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash 237363222, now seen corresponding path program 1 times [2019-01-02 00:06:33,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:33,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:33,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:06:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:06:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:06:33,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:06:33,674 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:06:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:06:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -625000989, now seen corresponding path program 1 times [2019-01-02 00:06:33,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:06:33,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:06:33,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:06:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:06:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:06:35,152 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 253 DAG size of output: 220 [2019-01-02 00:06:38,572 WARN L181 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 187 DAG size of output: 168 [2019-01-02 00:06:38,577 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:38,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:38,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:38,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:38,577 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:06:38,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:38,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:38,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:38,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration16_Loop [2019-01-02 00:06:38,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:38,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:38,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,001 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-02 00:06:39,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:39,957 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-02 00:06:40,361 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-02 00:06:45,945 WARN L181 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-01-02 00:06:46,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:06:46,179 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:46,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:46,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:46,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:46,193 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:46,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:46,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:46,218 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:46,218 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:46,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:46,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:46,242 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:06:46,242 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:46,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:06:46,265 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:06:46,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:06:46,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:06:58,449 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:06:58,455 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:06:58,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:06:58,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:06:58,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:06:58,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:06:58,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:06:58,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:06:58,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:06:58,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration16_Loop [2019-01-02 00:06:58,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:06:58,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:06:58,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,769 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-02 00:06:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:58,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:06:59,373 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-02 00:06:59,489 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-02 00:06:59,980 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-02 00:07:04,935 WARN L181 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-01-02 00:07:05,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:07:05,172 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:07:05,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:05,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:05,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,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 [2019-01-02 00:07:05,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,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 [2019-01-02 00:07:05,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,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 [2019-01-02 00:07:05,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,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 [2019-01-02 00:07:05,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,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 [2019-01-02 00:07:05,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,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 [2019-01-02 00:07:05,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:05,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:05,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:05,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:05,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:05,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:05,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:05,218 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2019-01-02 00:07:05,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:05,258 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-02 00:07:05,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:05,614 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:07:05,911 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:07:05,912 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:07:05,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:07:05,914 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:07:05,915 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:07:05,915 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 [] [2019-01-02 00:07:05,915 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:07:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:06,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:07:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:06,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:07:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:07:06,918 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 [2019-01-02 00:07:06,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 468 states and 685 transitions. cyclomatic complexity: 224 Second operand 16 states. [2019-01-02 00:07:11,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 468 states and 685 transitions. cyclomatic complexity: 224. Second operand 16 states. Result 3863 states and 5506 transitions. Complement of second has 37 states. [2019-01-02 00:07:11,350 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 [2019-01-02 00:07:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-02 00:07:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1570 transitions. [2019-01-02 00:07:11,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1570 transitions. Stem has 48 letters. Loop has 48 letters. [2019-01-02 00:07:11,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:07:11,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1570 transitions. Stem has 96 letters. Loop has 48 letters. [2019-01-02 00:07:11,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:07:11,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1570 transitions. Stem has 48 letters. Loop has 96 letters. [2019-01-02 00:07:11,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:07:11,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3863 states and 5506 transitions. [2019-01-02 00:07:11,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-02 00:07:11,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3863 states to 2340 states and 3362 transitions. [2019-01-02 00:07:11,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2073 [2019-01-02 00:07:11,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2075 [2019-01-02 00:07:11,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2340 states and 3362 transitions. [2019-01-02 00:07:11,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:11,400 INFO L705 BuchiCegarLoop]: Abstraction has 2340 states and 3362 transitions. [2019-01-02 00:07:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states and 3362 transitions. [2019-01-02 00:07:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 788. [2019-01-02 00:07:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-01-02 00:07:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1143 transitions. [2019-01-02 00:07:11,422 INFO L728 BuchiCegarLoop]: Abstraction has 788 states and 1143 transitions. [2019-01-02 00:07:11,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:07:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:07:11,426 INFO L87 Difference]: Start difference. First operand 788 states and 1143 transitions. Second operand 4 states. [2019-01-02 00:07:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:07:11,678 INFO L93 Difference]: Finished difference Result 2222 states and 3219 transitions. [2019-01-02 00:07:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:07:11,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2222 states and 3219 transitions. [2019-01-02 00:07:11,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1012 [2019-01-02 00:07:11,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2222 states to 2222 states and 3219 transitions. [2019-01-02 00:07:11,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1612 [2019-01-02 00:07:11,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1612 [2019-01-02 00:07:11,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2222 states and 3219 transitions. [2019-01-02 00:07:11,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:11,703 INFO L705 BuchiCegarLoop]: Abstraction has 2222 states and 3219 transitions. [2019-01-02 00:07:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states and 3219 transitions. [2019-01-02 00:07:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 762. [2019-01-02 00:07:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-01-02 00:07:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1094 transitions. [2019-01-02 00:07:11,725 INFO L728 BuchiCegarLoop]: Abstraction has 762 states and 1094 transitions. [2019-01-02 00:07:11,725 INFO L608 BuchiCegarLoop]: Abstraction has 762 states and 1094 transitions. [2019-01-02 00:07:11,730 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-02 00:07:11,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 1094 transitions. [2019-01-02 00:07:11,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 296 [2019-01-02 00:07:11,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:07:11,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:07:11,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:07:11,738 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] [2019-01-02 00:07:11,742 INFO L794 eck$LassoCheckResult]: Stem: 34678#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 34351#L-1 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;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;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; 34352#L116-2 assume !!(add_history_type_~var~0 < 3); 34759#L117 assume 0 == add_history_type_~history_id;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; 34620#L171 assume 0 == read_history_bool_~history_id; 34621#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 34316#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 34606#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 34607#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; 34783#L116-2 assume !(add_history_type_~var~0 < 3); 34781#L116-3 add_history_type_#res := 1; 34639#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 34640#L255 assume !(0 == init_~tmp~1);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; 34747#L116-6 assume !!(add_history_type_~var~0 < 3); 34745#L117-2 assume !(0 == add_history_type_~history_id); 34746#L123-2 assume 1 == add_history_type_~history_id;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; 34782#L171-4 assume !(0 == read_history_bool_~history_id); 34688#L181-4 assume 1 == read_history_bool_~history_id; 34689#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 34597#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 34415#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 34416#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; 34795#L116-6 assume !(add_history_type_~var~0 < 3); 34792#L116-7 add_history_type_#res := 1; 34684#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 34633#L259 assume !(0 == init_~tmp___0~1);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; 34634#L116-10 assume !!(add_history_type_~var~0 < 3); 34741#L117-4 assume !(0 == add_history_type_~history_id); 34743#L123-4 assume !(1 == add_history_type_~history_id); 34817#L129-4 assume 2 == add_history_type_~history_id;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; 34793#L171-8 assume !(0 == read_history_bool_~history_id); 34704#L181-8 assume !(1 == read_history_bool_~history_id); 34440#L191-8 assume 2 == read_history_bool_~history_id; 34441#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 34609#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 34372#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 34373#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 34327#L263 assume !(0 == init_~tmp___1~1);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; 34328#L116-14 assume !!(add_history_type_~var~0 < 3); 34728#L117-6 assume !(0 == add_history_type_~history_id); 34730#L123-6 assume 1 == add_history_type_~history_id;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; 34790#L171-10 assume !(0 == read_history_bool_~history_id); 34698#L181-10 assume 1 == read_history_bool_~history_id; 34699#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 34468#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 34387#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 34366#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 34679#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 34636#L270 main_#t~ret57 := init_#res;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; 34637#L550-2 assume !!(main_~i2~0 < 10);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;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; 34842#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; 35039#L570-16 assume 0 != ~gate1Failed~0 % 256; 34586#L391 [2019-01-02 00:07:11,742 INFO L796 eck$LassoCheckResult]: Loop: 34586#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 34625#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; 34635#L409 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;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; 34616#L226-2 assume !(0 == write_history_bool_~history_id); 34617#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; 34521#L570-17 assume 0 != ~gate2Failed~0 % 256; 34523#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 35069#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; 35068#L440 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;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; 35067#L226-4 assume !(0 == write_history_bool_~history_id); 35066#L231-4 assume !(1 == write_history_bool_~history_id); 35063#L236-4 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; 35059#L570-18 assume 0 != ~gate3Failed~0 % 256; 35057#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 35056#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; 34799#L471 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; 34750#L486 assume ~VALUE1~0 == ~VALUE2~0; 34752#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 34391#L570-19 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; 34535#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; 34488#L570-20 ~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;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; 34546#L294 assume !(0 == ~gate1Failed~0 % 256); 34828#L297 assume !(0 == ~gate2Failed~0 % 256); 34905#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 34822#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 34785#L171-12 assume 0 == read_history_bool_~history_id; 34748#L172-12 assume !(0 == read_history_bool_~historyIndex); 34723#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 34556#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 34693#L307 assume !(0 == check_~tmp___3~0 % 256); 34878#L307-1 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; 34877#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 34353#L575-54 assume !(0 == assert_~arg % 256); 34354#L570-27 read_history_int8_#res := -2; 34489#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 34490#L346 assume !(check_~tmp___10~0 > -2); 34727#L346-1 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; 34871#L151-9 assume 3 == read_history_int8_~history_id; 34870#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 34450#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 34869#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 34593#L366-1 check_#res := 1; 34560#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 34561#L575-72 assume !(0 == assert_~arg % 256); 34417#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 34418#L550-2 assume !!(main_~i2~0 < 10);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;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; 34626#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; 34584#L570-16 assume 0 != ~gate1Failed~0 % 256; 34586#L391 [2019-01-02 00:07:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 1 times [2019-01-02 00:07:11,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:11,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:07:11,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:11,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:07:11,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:07:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1234325878, now seen corresponding path program 1 times [2019-01-02 00:07:11,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:11,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:11,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:07:11,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:11,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:07:11,945 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:07:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:07:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:07:11,946 INFO L87 Difference]: Start difference. First operand 762 states and 1094 transitions. cyclomatic complexity: 340 Second operand 3 states. [2019-01-02 00:07:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:07:12,050 INFO L93 Difference]: Finished difference Result 1265 states and 1817 transitions. [2019-01-02 00:07:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:07:12,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1265 states and 1817 transitions. [2019-01-02 00:07:12,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2019-01-02 00:07:12,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1265 states to 1265 states and 1817 transitions. [2019-01-02 00:07:12,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 894 [2019-01-02 00:07:12,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 894 [2019-01-02 00:07:12,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1265 states and 1817 transitions. [2019-01-02 00:07:12,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:12,068 INFO L705 BuchiCegarLoop]: Abstraction has 1265 states and 1817 transitions. [2019-01-02 00:07:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states and 1817 transitions. [2019-01-02 00:07:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 879. [2019-01-02 00:07:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-01-02 00:07:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1276 transitions. [2019-01-02 00:07:12,091 INFO L728 BuchiCegarLoop]: Abstraction has 879 states and 1276 transitions. [2019-01-02 00:07:12,091 INFO L608 BuchiCegarLoop]: Abstraction has 879 states and 1276 transitions. [2019-01-02 00:07:12,091 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-02 00:07:12,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 879 states and 1276 transitions. [2019-01-02 00:07:12,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 355 [2019-01-02 00:07:12,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:07:12,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:07:12,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:07:12,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] [2019-01-02 00:07:12,105 INFO L794 eck$LassoCheckResult]: Stem: 36704#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 36386#L-1 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;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;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; 36387#L116-2 assume !!(add_history_type_~var~0 < 3); 36783#L117 assume 0 == add_history_type_~history_id;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; 36647#L171 assume 0 == read_history_bool_~history_id; 36648#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 36348#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 36633#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 36634#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; 36807#L116-2 assume !(add_history_type_~var~0 < 3); 36805#L116-3 add_history_type_#res := 1; 36666#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 36667#L255 assume !(0 == init_~tmp~1);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; 36774#L116-6 assume !!(add_history_type_~var~0 < 3); 36772#L117-2 assume !(0 == add_history_type_~history_id); 36773#L123-2 assume 1 == add_history_type_~history_id;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; 36806#L171-4 assume !(0 == read_history_bool_~history_id); 36715#L181-4 assume 1 == read_history_bool_~history_id; 36716#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 36622#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 36443#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 36444#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; 36822#L116-6 assume !(add_history_type_~var~0 < 3); 36819#L116-7 add_history_type_#res := 1; 36710#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 36657#L259 assume !(0 == init_~tmp___0~1);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; 36658#L116-10 assume !!(add_history_type_~var~0 < 3); 36767#L117-4 assume !(0 == add_history_type_~history_id); 36769#L123-4 assume !(1 == add_history_type_~history_id); 36838#L129-4 assume 2 == add_history_type_~history_id;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; 36820#L171-8 assume !(0 == read_history_bool_~history_id); 36730#L181-8 assume !(1 == read_history_bool_~history_id); 36473#L191-8 assume 2 == read_history_bool_~history_id; 36474#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 36636#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 36405#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 36406#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 36362#L263 assume !(0 == init_~tmp___1~1);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; 36363#L116-14 assume !!(add_history_type_~var~0 < 3); 36754#L117-6 assume !(0 == add_history_type_~history_id); 36756#L123-6 assume 1 == add_history_type_~history_id;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; 36817#L171-10 assume !(0 == read_history_bool_~history_id); 36724#L181-10 assume 1 == read_history_bool_~history_id; 36725#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 36488#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 36419#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 36395#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 36705#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 36663#L270 main_#t~ret57 := init_#res;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; 36664#L550-2 assume !!(main_~i2~0 < 10);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;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; 36653#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; 36609#L570-16 assume 0 != ~gate1Failed~0 % 256; 36611#L391 [2019-01-02 00:07:12,105 INFO L796 eck$LassoCheckResult]: Loop: 36611#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 36652#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; 36665#L409 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;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; 37212#L226-2 assume !(0 == write_history_bool_~history_id); 37210#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; 37203#L570-17 assume 0 != ~gate2Failed~0 % 256; 37201#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 37179#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; 37178#L440 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;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; 37177#L226-4 assume !(0 == write_history_bool_~history_id); 37176#L231-4 assume !(1 == write_history_bool_~history_id); 37175#L236-4 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; 37108#L570-18 assume 0 != ~gate3Failed~0 % 256; 37109#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 37189#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; 37188#L471 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; 37187#L486 assume ~VALUE1~0 == ~VALUE2~0; 36844#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 36425#L570-19 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; 36561#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; 36519#L570-20 ~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;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; 36572#L294 assume !(0 == ~gate1Failed~0 % 256); 36696#L297 assume !(0 == ~gate2Failed~0 % 256); 36697#L300 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2 := 0; 36841#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 36810#L171-12 assume 0 == read_history_bool_~history_id; 36775#L172-12 assume !(0 == read_history_bool_~historyIndex); 36749#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 36581#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 36399#L307 assume !(0 == check_~tmp___3~0 % 256); 36400#L307-1 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; 36410#L151-7 assume 3 == read_history_int8_~history_id; 36512#L152-7 assume !(0 == read_history_int8_~historyIndex); 36513#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 36520#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 36521#L346 assume !(check_~tmp___10~0 > -2); 36771#L346-1 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; 36912#L151-9 assume 3 == read_history_int8_~history_id; 36911#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 36482#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 36861#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 36620#L366-1 check_#res := 1; 36619#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 37215#L575-72 assume !(0 == assert_~arg % 256); 37214#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 37213#L550-2 assume !!(main_~i2~0 < 10);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;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; 37205#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; 37202#L570-16 assume 0 != ~gate1Failed~0 % 256; 36611#L391 [2019-01-02 00:07:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 2 times [2019-01-02 00:07:12,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:12,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:07:12,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:12,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:07:12,264 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:07:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1545733139, now seen corresponding path program 1 times [2019-01-02 00:07:12,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:12,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:07:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:07:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:12,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:07:12,327 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:07:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:07:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:07:12,327 INFO L87 Difference]: Start difference. First operand 879 states and 1276 transitions. cyclomatic complexity: 405 Second operand 3 states. [2019-01-02 00:07:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:07:12,401 INFO L93 Difference]: Finished difference Result 882 states and 1276 transitions. [2019-01-02 00:07:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:07:12,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 1276 transitions. [2019-01-02 00:07:12,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 337 [2019-01-02 00:07:12,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 857 states and 1236 transitions. [2019-01-02 00:07:12,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 589 [2019-01-02 00:07:12,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 589 [2019-01-02 00:07:12,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 857 states and 1236 transitions. [2019-01-02 00:07:12,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:12,417 INFO L705 BuchiCegarLoop]: Abstraction has 857 states and 1236 transitions. [2019-01-02 00:07:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states and 1236 transitions. [2019-01-02 00:07:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2019-01-02 00:07:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-01-02 00:07:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1236 transitions. [2019-01-02 00:07:12,437 INFO L728 BuchiCegarLoop]: Abstraction has 857 states and 1236 transitions. [2019-01-02 00:07:12,437 INFO L608 BuchiCegarLoop]: Abstraction has 857 states and 1236 transitions. [2019-01-02 00:07:12,438 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-02 00:07:12,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 857 states and 1236 transitions. [2019-01-02 00:07:12,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 337 [2019-01-02 00:07:12,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:07:12,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:07:12,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:07:12,446 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] [2019-01-02 00:07:12,446 INFO L794 eck$LassoCheckResult]: Stem: 38468#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 38155#L-1 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;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;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; 38156#L116-2 assume !!(add_history_type_~var~0 < 3); 38549#L117 assume 0 == add_history_type_~history_id;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; 38414#L171 assume 0 == read_history_bool_~history_id; 38415#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 38117#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 38400#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 38401#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; 38569#L116-2 assume !(add_history_type_~var~0 < 3); 38567#L116-3 add_history_type_#res := 1; 38432#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 38433#L255 assume !(0 == init_~tmp~1);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; 38539#L116-6 assume !!(add_history_type_~var~0 < 3); 38537#L117-2 assume !(0 == add_history_type_~history_id); 38538#L123-2 assume 1 == add_history_type_~history_id;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; 38568#L171-4 assume !(0 == read_history_bool_~history_id); 38478#L181-4 assume 1 == read_history_bool_~history_id; 38479#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38389#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38213#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 38214#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; 38581#L116-6 assume !(add_history_type_~var~0 < 3); 38578#L116-7 add_history_type_#res := 1; 38474#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 38424#L259 assume !(0 == init_~tmp___0~1);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; 38425#L116-10 assume !!(add_history_type_~var~0 < 3); 38532#L117-4 assume !(0 == add_history_type_~history_id); 38534#L123-4 assume !(1 == add_history_type_~history_id); 38595#L129-4 assume 2 == add_history_type_~history_id;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; 38579#L171-8 assume !(0 == read_history_bool_~history_id); 38493#L181-8 assume !(1 == read_history_bool_~history_id); 38243#L191-8 assume 2 == read_history_bool_~history_id; 38244#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 38403#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 38174#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38175#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 38131#L263 assume !(0 == init_~tmp___1~1);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; 38132#L116-14 assume !!(add_history_type_~var~0 < 3); 38516#L117-6 assume !(0 == add_history_type_~history_id); 38518#L123-6 assume 1 == add_history_type_~history_id;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; 38576#L171-10 assume !(0 == read_history_bool_~history_id); 38487#L181-10 assume 1 == read_history_bool_~history_id; 38488#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38258#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38188#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38164#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 38469#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 38429#L270 main_#t~ret57 := init_#res;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; 38430#L550-2 assume !!(main_~i2~0 < 10);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;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; 38613#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; 38761#L570-16 assume 0 != ~gate1Failed~0 % 256; 38380#L391 [2019-01-02 00:07:12,450 INFO L796 eck$LassoCheckResult]: Loop: 38380#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 38419#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; 38431#L409 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;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; 38410#L226-2 assume !(0 == write_history_bool_~history_id); 38411#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; 38317#L570-17 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; 38318#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 38338#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 38215#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 38216#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; 38229#L440 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;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; 38855#L226-4 assume !(0 == write_history_bool_~history_id); 38854#L231-4 assume !(1 == write_history_bool_~history_id); 38853#L236-4 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; 38850#L570-18 assume 0 != ~gate3Failed~0 % 256; 38851#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 38902#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; 38901#L471 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; 38900#L486 assume ~VALUE1~0 == ~VALUE2~0; 38893#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 38892#L570-19 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; 38891#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; 38889#L570-20 ~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;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; 38857#L294 assume !(0 == ~gate1Failed~0 % 256); 38668#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 38666#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 38663#L171-12 assume 0 == read_history_bool_~history_id; 38661#L172-12 assume !(0 == read_history_bool_~historyIndex); 38659#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 38656#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 38627#L307 assume !(0 == check_~tmp___3~0 % 256); 38624#L307-1 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; 38623#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 38157#L575-54 assume !(0 == assert_~arg % 256); 38158#L570-27 read_history_int8_#res := -2; 38309#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 38620#L346 assume !(check_~tmp___10~0 > -2); 38536#L346-1 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; 38619#L151-9 assume 3 == read_history_int8_~history_id; 38618#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 38252#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 38617#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 38387#L366-1 check_#res := 1; 38354#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 38355#L575-72 assume !(0 == assert_~arg % 256); 38221#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 38222#L550-2 assume !!(main_~i2~0 < 10);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;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; 38420#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; 38378#L570-16 assume 0 != ~gate1Failed~0 % 256; 38380#L391 [2019-01-02 00:07:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 3 times [2019-01-02 00:07:12,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:07:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:07:12,554 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:07:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1781807208, now seen corresponding path program 1 times [2019-01-02 00:07:12,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:12,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:12,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:07:12,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:07:12,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:12,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:07:12,623 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:07:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:07:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:07:12,624 INFO L87 Difference]: Start difference. First operand 857 states and 1236 transitions. cyclomatic complexity: 387 Second operand 3 states. [2019-01-02 00:07:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:07:12,831 INFO L93 Difference]: Finished difference Result 1395 states and 2012 transitions. [2019-01-02 00:07:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:07:12,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1395 states and 2012 transitions. [2019-01-02 00:07:12,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 319 [2019-01-02 00:07:12,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1395 states to 1395 states and 2012 transitions. [2019-01-02 00:07:12,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 960 [2019-01-02 00:07:12,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 960 [2019-01-02 00:07:12,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1395 states and 2012 transitions. [2019-01-02 00:07:12,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:12,846 INFO L705 BuchiCegarLoop]: Abstraction has 1395 states and 2012 transitions. [2019-01-02 00:07:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states and 2012 transitions. [2019-01-02 00:07:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 823. [2019-01-02 00:07:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-01-02 00:07:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1183 transitions. [2019-01-02 00:07:12,863 INFO L728 BuchiCegarLoop]: Abstraction has 823 states and 1183 transitions. [2019-01-02 00:07:12,863 INFO L608 BuchiCegarLoop]: Abstraction has 823 states and 1183 transitions. [2019-01-02 00:07:12,863 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-02 00:07:12,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 823 states and 1183 transitions. [2019-01-02 00:07:12,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 319 [2019-01-02 00:07:12,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:07:12,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:07:12,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:07:12,872 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] [2019-01-02 00:07:12,872 INFO L794 eck$LassoCheckResult]: Stem: 40716#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 40413#L-1 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;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;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; 40414#L116-2 assume !!(add_history_type_~var~0 < 3); 40795#L117 assume 0 == add_history_type_~history_id;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; 40657#L171 assume 0 == read_history_bool_~history_id; 40658#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 40377#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 40643#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 40644#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; 40818#L116-2 assume !(add_history_type_~var~0 < 3); 40816#L116-3 add_history_type_#res := 1; 40677#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 40678#L255 assume !(0 == init_~tmp~1);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; 40782#L116-6 assume !!(add_history_type_~var~0 < 3); 40780#L117-2 assume !(0 == add_history_type_~history_id); 40781#L123-2 assume 1 == add_history_type_~history_id;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; 40817#L171-4 assume !(0 == read_history_bool_~history_id); 40726#L181-4 assume 1 == read_history_bool_~history_id; 40727#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40630#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 40459#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 40460#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; 40831#L116-6 assume !(add_history_type_~var~0 < 3); 40828#L116-7 add_history_type_#res := 1; 40722#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 40667#L259 assume !(0 == init_~tmp___0~1);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; 40668#L116-10 assume !!(add_history_type_~var~0 < 3); 40775#L117-4 assume !(0 == add_history_type_~history_id); 40777#L123-4 assume !(1 == add_history_type_~history_id); 40848#L129-4 assume 2 == add_history_type_~history_id;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; 40829#L171-8 assume !(0 == read_history_bool_~history_id); 40741#L181-8 assume !(1 == read_history_bool_~history_id); 40484#L191-8 assume 2 == read_history_bool_~history_id; 40485#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 40646#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 40430#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 40431#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 40391#L263 assume !(0 == init_~tmp___1~1);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; 40392#L116-14 assume !!(add_history_type_~var~0 < 3); 40762#L117-6 assume !(0 == add_history_type_~history_id); 40764#L123-6 assume 1 == add_history_type_~history_id;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; 40826#L171-10 assume !(0 == read_history_bool_~history_id); 40735#L181-10 assume 1 == read_history_bool_~history_id; 40736#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40494#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 40443#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 40420#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 40717#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 40672#L270 main_#t~ret57 := init_#res;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; 40673#L550-2 assume !!(main_~i2~0 < 10);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;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; 40874#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; 41042#L570-16 assume 0 != ~gate1Failed~0 % 256; 40619#L391 [2019-01-02 00:07:12,872 INFO L796 eck$LassoCheckResult]: Loop: 40619#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 40662#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; 40674#L409 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;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; 40653#L226-2 assume !(0 == write_history_bool_~history_id); 40654#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; 41084#L570-17 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; 41085#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 41196#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 40461#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 40462#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; 41012#L440 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;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; 41010#L226-4 assume !(0 == write_history_bool_~history_id); 41008#L231-4 assume !(1 == write_history_bool_~history_id); 41006#L236-4 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; 41003#L570-18 assume 0 != ~gate3Failed~0 % 256; 40791#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 40771#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; 40772#L471 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; 41153#L486 assume ~VALUE1~0 == ~VALUE2~0; 41146#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 40952#L570-19 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; 40949#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; 40946#L570-20 ~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;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; 40945#L294 assume !(0 == ~gate1Failed~0 % 256); 40913#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 40912#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 40909#L171-12 assume 0 == read_history_bool_~history_id; 40910#L172-12 assume !(0 == read_history_bool_~historyIndex); 40898#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 40891#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 40883#L307 assume !(0 == check_~tmp___3~0 % 256); 40871#L307-1 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; 40870#L151-7 assume 3 == read_history_int8_~history_id; 40869#L152-7 assume !(0 == read_history_int8_~historyIndex); 40868#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 40794#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 40867#L346 assume !(check_~tmp___10~0 > -2); 40779#L346-1 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; 40866#L151-9 assume 3 == read_history_int8_~history_id; 40865#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 40793#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 40864#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 40628#L366-1 check_#res := 1; 40627#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 41050#L575-72 assume !(0 == assert_~arg % 256); 40465#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 40466#L550-2 assume !!(main_~i2~0 < 10);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;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; 40663#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; 40617#L570-16 assume 0 != ~gate1Failed~0 % 256; 40619#L391 [2019-01-02 00:07:12,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:12,872 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 4 times [2019-01-02 00:07:12,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:12,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:12,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:12,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:07:13,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:13,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:07:13,027 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:07:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1138800419, now seen corresponding path program 1 times [2019-01-02 00:07:13,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:13,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:13,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:07:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:07:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:07:14,098 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 257 DAG size of output: 224 [2019-01-02 00:07:17,089 WARN L181 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2019-01-02 00:07:17,097 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:07:17,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:07:17,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:07:17,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:07:17,097 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:07:17,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:17,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:07:17,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:07:17,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2019-01-02 00:07:17,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:07:17,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:07:17,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,408 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-02 00:07:17,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:17,978 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-02 00:07:18,230 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-02 00:07:18,480 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:07:18,653 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-02 00:07:23,590 WARN L181 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-01-02 00:07:23,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:07:23,834 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:23,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:23,849 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:23,861 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:23,862 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:23,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:23,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:07:23,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:23,917 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:23,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:23,960 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:23,973 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:23,974 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,027 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,039 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,095 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,106 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,158 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,171 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,171 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,217 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,229 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,276 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,285 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,331 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,341 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:07:24,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:07:24,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,454 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,500 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:24,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:07:24,514 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:24,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:07:24,562 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:07:25,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:07:25,192 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:37,583 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:07:37,599 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:07:37,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:07:37,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:07:37,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:07:37,599 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:07:37,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:37,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:07:37,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:07:37,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2019-01-02 00:07:37,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:07:37,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:07:37,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,870 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-02 00:07:37,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:37,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:38,433 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-02 00:07:38,717 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:07:44,064 WARN L181 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-01-02 00:07:44,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:07:44,328 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:07:44,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:07:44,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:07:44,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:07:44,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:07:44,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:07:44,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:07:44,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:07:44,382 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2019-01-02 00:07:44,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:07:44,405 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-02 00:07:44,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:07:44,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:07:44,741 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:07:44,743 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:07:44,745 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:07:44,745 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:07:44,745 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:07:44,746 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g2v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g2v_old~0 + 1*~nomsg~0 Supporting invariants [] [2019-01-02 00:07:44,746 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:07:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:44,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:07:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:44,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:07:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:07:45,410 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 [2019-01-02 00:07:45,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 823 states and 1183 transitions. cyclomatic complexity: 368 Second operand 17 states. [2019-01-02 00:07:47,439 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 823 states and 1183 transitions. cyclomatic complexity: 368. Second operand 17 states. Result 4447 states and 6229 transitions. Complement of second has 41 states. [2019-01-02 00:07:47,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2019-01-02 00:07:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:07:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1678 transitions. [2019-01-02 00:07:47,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1678 transitions. Stem has 52 letters. Loop has 49 letters. [2019-01-02 00:07:47,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:07:47,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1678 transitions. Stem has 101 letters. Loop has 49 letters. [2019-01-02 00:07:47,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:07:47,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1678 transitions. Stem has 52 letters. Loop has 98 letters. [2019-01-02 00:07:47,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:07:47,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4447 states and 6229 transitions. [2019-01-02 00:07:47,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 554 [2019-01-02 00:07:47,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4447 states to 2957 states and 4197 transitions. [2019-01-02 00:07:47,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2491 [2019-01-02 00:07:47,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2493 [2019-01-02 00:07:47,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2957 states and 4197 transitions. [2019-01-02 00:07:47,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:47,572 INFO L705 BuchiCegarLoop]: Abstraction has 2957 states and 4197 transitions. [2019-01-02 00:07:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states and 4197 transitions. [2019-01-02 00:07:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1422. [2019-01-02 00:07:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-01-02 00:07:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2035 transitions. [2019-01-02 00:07:47,610 INFO L728 BuchiCegarLoop]: Abstraction has 1422 states and 2035 transitions. [2019-01-02 00:07:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:07:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:07:47,615 INFO L87 Difference]: Start difference. First operand 1422 states and 2035 transitions. Second operand 4 states. [2019-01-02 00:07:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:07:47,687 INFO L93 Difference]: Finished difference Result 2699 states and 3866 transitions. [2019-01-02 00:07:47,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:07:47,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2699 states and 3866 transitions. [2019-01-02 00:07:47,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1108 [2019-01-02 00:07:47,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2699 states to 2697 states and 3864 transitions. [2019-01-02 00:07:47,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1896 [2019-01-02 00:07:47,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1896 [2019-01-02 00:07:47,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2697 states and 3864 transitions. [2019-01-02 00:07:47,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:07:47,715 INFO L705 BuchiCegarLoop]: Abstraction has 2697 states and 3864 transitions. [2019-01-02 00:07:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states and 3864 transitions. [2019-01-02 00:07:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1422. [2019-01-02 00:07:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-01-02 00:07:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2034 transitions. [2019-01-02 00:07:47,741 INFO L728 BuchiCegarLoop]: Abstraction has 1422 states and 2034 transitions. [2019-01-02 00:07:47,741 INFO L608 BuchiCegarLoop]: Abstraction has 1422 states and 2034 transitions. [2019-01-02 00:07:47,741 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-02 00:07:47,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1422 states and 2034 transitions. [2019-01-02 00:07:47,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 554 [2019-01-02 00:07:47,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:07:47,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:07:47,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:07:47,749 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] [2019-01-02 00:07:47,749 INFO L794 eck$LassoCheckResult]: Stem: 50512#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 50211#L-1 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;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;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; 50212#L116-2 assume !!(add_history_type_~var~0 < 3); 50598#L117 assume 0 == add_history_type_~history_id;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; 50453#L171 assume 0 == read_history_bool_~history_id; 50454#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 50178#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 50439#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 50440#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; 50625#L116-2 assume !(add_history_type_~var~0 < 3); 50623#L116-3 add_history_type_#res := 1; 50476#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 50477#L255 assume !(0 == init_~tmp~1);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; 50585#L116-6 assume !!(add_history_type_~var~0 < 3); 50583#L117-2 assume !(0 == add_history_type_~history_id); 50584#L123-2 assume 1 == add_history_type_~history_id;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; 50624#L171-4 assume !(0 == read_history_bool_~history_id); 50523#L181-4 assume 1 == read_history_bool_~history_id; 50524#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 50428#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 50260#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 50261#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; 50639#L116-6 assume !(add_history_type_~var~0 < 3); 50636#L116-7 add_history_type_#res := 1; 50519#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 50469#L259 assume !(0 == init_~tmp___0~1);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; 50470#L116-10 assume !!(add_history_type_~var~0 < 3); 50579#L117-4 assume !(0 == add_history_type_~history_id); 50581#L123-4 assume !(1 == add_history_type_~history_id); 50655#L129-4 assume 2 == add_history_type_~history_id;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; 50637#L171-8 assume !(0 == read_history_bool_~history_id); 50543#L181-8 assume !(1 == read_history_bool_~history_id); 50280#L191-8 assume 2 == read_history_bool_~history_id; 50281#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 50442#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 50228#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 50229#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; 50630#L116-10 assume !(add_history_type_~var~0 < 3); 50616#L116-11 add_history_type_#res := 1; 50514#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 50189#L263 assume !(0 == init_~tmp___1~1);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; 50190#L116-14 assume !!(add_history_type_~var~0 < 3); 50565#L117-6 assume !(0 == add_history_type_~history_id); 50567#L123-6 assume 1 == add_history_type_~history_id;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; 50634#L171-10 assume !(0 == read_history_bool_~history_id); 50537#L181-10 assume 1 == read_history_bool_~history_id; 50538#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 50294#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 50239#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 50218#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 50513#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 50473#L270 main_#t~ret57 := init_#res;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; 50474#L550-2 assume !!(main_~i2~0 < 10);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;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; 50847#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; 51181#L570-16 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; 51180#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 51004#L399 [2019-01-02 00:07:47,750 INFO L796 eck$LassoCheckResult]: Loop: 51004#L399 assume 1 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 51002#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 51001#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; 51000#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; 50996#L409 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;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; 50993#L226-2 assume !(0 == write_history_bool_~history_id); 50987#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; 50982#L570-17 assume 0 != ~gate2Failed~0 % 256; 50979#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 50976#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; 50972#L440 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;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; 50968#L226-4 assume !(0 == write_history_bool_~history_id); 50967#L231-4 assume !(1 == write_history_bool_~history_id); 50966#L236-4 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; 50964#L570-18 assume 0 != ~gate3Failed~0 % 256; 50594#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 50574#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; 50575#L471 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; 51325#L486 assume ~VALUE1~0 == ~VALUE2~0; 51307#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 51304#L570-19 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; 51303#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; 51301#L570-20 ~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;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; 51138#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 51132#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 51129#L171-12 assume 0 == read_history_bool_~history_id; 51127#L172-12 assume !(0 == read_history_bool_~historyIndex); 51125#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 51123#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 50890#L307 assume !(0 == check_~tmp___3~0 % 256); 50652#L307-1 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; 50885#L151-7 assume 3 == read_history_int8_~history_id; 50884#L152-7 assume !(0 == read_history_int8_~historyIndex); 50881#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 50879#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 50877#L346 assume !(check_~tmp___10~0 > -2); 50600#L346-1 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; 51110#L151-9 assume 3 == read_history_int8_~history_id; 51104#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 51103#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 51102#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 50560#L366-1 check_#res := 1; 50392#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 50393#L575-72 assume !(0 == assert_~arg % 256); 50262#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 50263#L550-2 assume !!(main_~i2~0 < 10);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;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; 50463#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; 50418#L570-16 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; 50680#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 51004#L399 [2019-01-02 00:07:47,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash -432897677, now seen corresponding path program 1 times [2019-01-02 00:07:47,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:47,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:47,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:47,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:47,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:07:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:07:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:07:47,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:07:47,833 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:07:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:07:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash 974165309, now seen corresponding path program 1 times [2019-01-02 00:07:47,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:07:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:07:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:47,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:07:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:07:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:07:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:07:48,958 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 259 DAG size of output: 226 [2019-01-02 00:07:52,123 WARN L181 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2019-01-02 00:07:52,126 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:07:52,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:07:52,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:07:52,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:07:52,126 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:07:52,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:07:52,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:07:52,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:07:52,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2019-01-02 00:07:52,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:07:52,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:07:52,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,622 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-02 00:07:52,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:52,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:07:53,220 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-02 00:07:53,448 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-02 00:07:53,600 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:08:03,393 WARN L181 SmtUtils]: Spent 9.67 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2019-01-02 00:08:03,569 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:03,569 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,577 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,583 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,583 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,615 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,641 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,645 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,676 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,677 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,701 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,710 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,741 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,741 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,774 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,774 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,804 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,805 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,830 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,834 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,862 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,863 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,888 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,893 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,893 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,924 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,924 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:08:03,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,949 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:03,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,954 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:03,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:03,977 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:03,983 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:03,984 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,005 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,013 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,013 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,044 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,068 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,073 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,095 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,102 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,132 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,159 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,159 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,186 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,208 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,230 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,230 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,238 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,276 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,306 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___0~2=0} Honda state: {ULTIMATE.start_check_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,335 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,378 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,378 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_13=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,393 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,455 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,482 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,509 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,537 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,537 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret11=0} Honda state: {ULTIMATE.start_check_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,565 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,594 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,594 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,617 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,628 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,628 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~next_state~1=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~next_state~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,651 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,656 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,656 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:04,685 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,685 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,713 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,718 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:04,719 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:04,740 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:04,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:08:04,770 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,929 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:08:04,931 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:04,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:04,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:04,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:04,932 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:08:04,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:04,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:04,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:04,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2019-01-02 00:08:04,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:04,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:04,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:04,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,402 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-02 00:08:05,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08: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 [2019-01-02 00:08:05,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08: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 [2019-01-02 00:08:05,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08: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 [2019-01-02 00:08:05,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:05,946 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-02 00:08:06,227 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-02 00:08:06,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:08:16,379 WARN L181 SmtUtils]: Spent 9.84 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2019-01-02 00:08:16,675 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:16,675 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:16,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:16,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:16,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:16,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:16,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:16,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,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 [2019-01-02 00:08:16,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:16,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:16,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:16,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:16,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:16,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:16,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:16,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:16,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:16,795 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:08:16,796 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:08:16,796 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:08:16,796 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:08:16,797 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:08:16,797 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:08:16,797 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:08:16,797 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:08:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:17,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:17,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:17,607 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 [2019-01-02 00:08:17,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1422 states and 2034 transitions. cyclomatic complexity: 622 Second operand 5 states. [2019-01-02 00:08:17,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1422 states and 2034 transitions. cyclomatic complexity: 622. Second operand 5 states. Result 3444 states and 4936 transitions. Complement of second has 6 states. [2019-01-02 00:08:17,641 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 [2019-01-02 00:08:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:08:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2019-01-02 00:08:17,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 637 transitions. Stem has 56 letters. Loop has 49 letters. [2019-01-02 00:08:17,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:17,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 637 transitions. Stem has 105 letters. Loop has 49 letters. [2019-01-02 00:08:17,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:17,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 637 transitions. Stem has 56 letters. Loop has 98 letters. [2019-01-02 00:08:17,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:17,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3444 states and 4936 transitions. [2019-01-02 00:08:17,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2019-01-02 00:08:17,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3444 states to 1414 states and 2013 transitions. [2019-01-02 00:08:17,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 974 [2019-01-02 00:08:17,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 974 [2019-01-02 00:08:17,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1414 states and 2013 transitions. [2019-01-02 00:08:17,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:08:17,663 INFO L705 BuchiCegarLoop]: Abstraction has 1414 states and 2013 transitions. [2019-01-02 00:08:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states and 2013 transitions. [2019-01-02 00:08:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-01-02 00:08:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-01-02 00:08:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2013 transitions. [2019-01-02 00:08:17,682 INFO L728 BuchiCegarLoop]: Abstraction has 1414 states and 2013 transitions. [2019-01-02 00:08:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:08:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:08:17,682 INFO L87 Difference]: Start difference. First operand 1414 states and 2013 transitions. Second operand 3 states. [2019-01-02 00:08:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:17,857 INFO L93 Difference]: Finished difference Result 1362 states and 1933 transitions. [2019-01-02 00:08:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:08:17,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 1933 transitions. [2019-01-02 00:08:17,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2019-01-02 00:08:17,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1362 states and 1933 transitions. [2019-01-02 00:08:17,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 951 [2019-01-02 00:08:17,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 951 [2019-01-02 00:08:17,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1362 states and 1933 transitions. [2019-01-02 00:08:17,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:08:17,869 INFO L705 BuchiCegarLoop]: Abstraction has 1362 states and 1933 transitions. [2019-01-02 00:08:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states and 1933 transitions. [2019-01-02 00:08:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2019-01-02 00:08:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-01-02 00:08:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1933 transitions. [2019-01-02 00:08:17,905 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 1933 transitions. [2019-01-02 00:08:17,905 INFO L608 BuchiCegarLoop]: Abstraction has 1362 states and 1933 transitions. [2019-01-02 00:08:17,905 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-02 00:08:17,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 1933 transitions. [2019-01-02 00:08:17,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2019-01-02 00:08:17,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:17,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:17,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:17,918 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] [2019-01-02 00:08:17,919 INFO L794 eck$LassoCheckResult]: Stem: 58462#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 58185#L-1 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;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;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; 58186#L116-2 assume !!(add_history_type_~var~0 < 3); 58534#L117 assume 0 == add_history_type_~history_id;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; 58401#L171 assume 0 == read_history_bool_~history_id; 58402#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 58158#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 58387#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 58388#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; 58558#L116-2 assume !(add_history_type_~var~0 < 3); 58556#L116-3 add_history_type_#res := 1; 58424#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 58425#L255 assume !(0 == init_~tmp~1);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; 58524#L116-6 assume !!(add_history_type_~var~0 < 3); 58522#L117-2 assume !(0 == add_history_type_~history_id); 58523#L123-2 assume 1 == add_history_type_~history_id;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; 58557#L171-4 assume !(0 == read_history_bool_~history_id); 58475#L181-4 assume 1 == read_history_bool_~history_id; 58476#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 58375#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 58225#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 58226#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; 58567#L116-6 assume !(add_history_type_~var~0 < 3); 58564#L116-7 add_history_type_#res := 1; 58470#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 58416#L259 assume !(0 == init_~tmp___0~1);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; 58417#L116-10 assume !!(add_history_type_~var~0 < 3); 58518#L117-4 assume !(0 == add_history_type_~history_id); 58520#L123-4 assume !(1 == add_history_type_~history_id); 58589#L129-4 assume 2 == add_history_type_~history_id;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; 58565#L171-8 assume !(0 == read_history_bool_~history_id); 58481#L181-8 assume !(1 == read_history_bool_~history_id); 58239#L191-8 assume 2 == read_history_bool_~history_id; 58240#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 58390#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 58199#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 58200#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; 58572#L116-10 assume !(add_history_type_~var~0 < 3); 58551#L116-11 add_history_type_#res := 1; 58465#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 58169#L263 assume !(0 == init_~tmp___1~1);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; 58170#L116-14 assume !!(add_history_type_~var~0 < 3); 58505#L117-6 assume !(0 == add_history_type_~history_id); 58507#L123-6 assume !(1 == add_history_type_~history_id); 58579#L129-6 assume !(2 == add_history_type_~history_id); 58358#L135-9 assume 3 == add_history_type_~history_id;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; 58359#L151-3 assume 3 == read_history_int8_~history_id; 58376#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 58377#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 58382#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 58463#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 58464#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 58421#L270 main_#t~ret57 := init_#res;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; 58422#L550-2 assume !!(main_~i2~0 < 10);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;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; 58630#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; 58633#L570-16 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; 58846#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 58845#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 58843#L408 assume !(gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite30 := ~g1v_new~0; 58844#L408-2 [2019-01-02 00:08:17,919 INFO L796 eck$LassoCheckResult]: Loop: 58844#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; 59176#L409 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;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; 59174#L226-2 assume !(0 == write_history_bool_~history_id); 59170#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; 59166#L570-17 assume 0 != ~gate2Failed~0 % 256; 59167#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 59175#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; 59173#L440 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;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; 59172#L226-4 assume !(0 == write_history_bool_~history_id); 59168#L231-4 assume !(1 == write_history_bool_~history_id); 59165#L236-4 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; 59162#L570-18 assume 0 != ~gate3Failed~0 % 256; 59163#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 59361#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; 59360#L471 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; 59359#L486 assume ~VALUE1~0 == ~VALUE2~0; 59341#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 59338#L570-19 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; 59337#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; 59335#L570-20 ~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;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; 59115#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 59111#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 59108#L171-12 assume 0 == read_history_bool_~history_id; 59105#L172-12 assume !(0 == read_history_bool_~historyIndex); 59103#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 59098#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 59093#L307 assume !(0 == check_~tmp___3~0 % 256); 58385#L307-1 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; 59087#L151-7 assume 3 == read_history_int8_~history_id; 58270#L152-7 assume !(0 == read_history_int8_~historyIndex); 58271#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 58276#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 58277#L346 assume !(check_~tmp___10~0 > -2); 58504#L346-1 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; 59431#L151-9 assume 3 == read_history_int8_~history_id; 59430#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 58261#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 58262#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 58371#L366-1 check_#res := 1; 58348#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 58349#L575-72 assume !(0 == assert_~arg % 256); 58227#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 58228#L550-2 assume !!(main_~i2~0 < 10);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;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; 58637#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; 58613#L570-16 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; 58614#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 59178#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 59177#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; 58844#L408-2 [2019-01-02 00:08:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1595648815, now seen corresponding path program 1 times [2019-01-02 00:08:17,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:17,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:17,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:08:18,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:18,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:08:18,025 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1676599907, now seen corresponding path program 2 times [2019-01-02 00:08:18,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:18,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:18,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:19,058 WARN L181 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 222 [2019-01-02 00:08:24,202 WARN L181 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 191 DAG size of output: 180 [2019-01-02 00:08:24,206 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:24,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:24,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:24,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:24,206 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:08:24,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:24,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:24,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:24,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration22_Loop [2019-01-02 00:08:24,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:24,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:24,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:08:24,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08: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 [2019-01-02 00:08: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 [2019-01-02 00:08:24,631 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-01-02 00:08:24,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08: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 [2019-01-02 00:08:24,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08: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 [2019-01-02 00:08:24,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:24,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:25,525 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-01-02 00:08:25,761 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-02 00:08:25,918 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-02 00:08:36,807 WARN L181 SmtUtils]: Spent 10.87 s on a formula simplification. DAG size of input: 257 DAG size of output: 145 [2019-01-02 00:08:37,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:37,222 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:37,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:37,238 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:37,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:37,244 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:37,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:37,265 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:37,272 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:37,272 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:37,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:37,291 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:37,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:08:37,298 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:37,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:37,323 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:08:38,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:08:38,675 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:51,266 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:08:51,287 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:51,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:51,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:51,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:51,287 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:08:51,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:51,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:51,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:51,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration22_Loop [2019-01-02 00:08:51,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:51,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:51,291 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:08:51,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,865 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-01-02 00:08:51,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,695 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-01-02 00:08:52,862 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-02 00:08:53,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-02 00:09:03,788 WARN L181 SmtUtils]: Spent 10.69 s on a formula simplification. DAG size of input: 257 DAG size of output: 145 [2019-01-02 00:09:03,969 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:03,972 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:03,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,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 [2019-01-02 00:09:04,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:04,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:04,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:04,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:04,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:04,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:04,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:04,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:04,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:04,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:04,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:04,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:04,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:04,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:04,042 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:04,042 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:04,042 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:04,043 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:04,043 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:04,043 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:09:04,043 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:04,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:04,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:04,533 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 [2019-01-02 00:09:04,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1362 states and 1933 transitions. cyclomatic complexity: 579 Second operand 5 states. [2019-01-02 00:09:04,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1362 states and 1933 transitions. cyclomatic complexity: 579. Second operand 5 states. Result 3371 states and 4792 transitions. Complement of second has 6 states. [2019-01-02 00:09:04,576 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 [2019-01-02 00:09:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:09:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2019-01-02 00:09:04,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 596 transitions. Stem has 59 letters. Loop has 48 letters. [2019-01-02 00:09:04,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:04,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 596 transitions. Stem has 107 letters. Loop has 48 letters. [2019-01-02 00:09:04,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:04,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 596 transitions. Stem has 59 letters. Loop has 96 letters. [2019-01-02 00:09:04,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:04,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3371 states and 4792 transitions. [2019-01-02 00:09:04,592 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2019-01-02 00:09:04,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3371 states to 1362 states and 1928 transitions. [2019-01-02 00:09:04,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 951 [2019-01-02 00:09:04,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 951 [2019-01-02 00:09:04,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1362 states and 1928 transitions. [2019-01-02 00:09:04,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:09:04,598 INFO L705 BuchiCegarLoop]: Abstraction has 1362 states and 1928 transitions. [2019-01-02 00:09:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states and 1928 transitions. [2019-01-02 00:09:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2019-01-02 00:09:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-01-02 00:09:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1928 transitions. [2019-01-02 00:09:04,614 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 1928 transitions. [2019-01-02 00:09:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:09:04,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:09:04,615 INFO L87 Difference]: Start difference. First operand 1362 states and 1928 transitions. Second operand 4 states. [2019-01-02 00:09:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:04,934 INFO L93 Difference]: Finished difference Result 1364 states and 1929 transitions. [2019-01-02 00:09:04,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:09:04,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1364 states and 1929 transitions. [2019-01-02 00:09:04,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2019-01-02 00:09:04,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1364 states to 1362 states and 1927 transitions. [2019-01-02 00:09:04,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 951 [2019-01-02 00:09:04,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 951 [2019-01-02 00:09:04,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1362 states and 1927 transitions. [2019-01-02 00:09:04,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:09:04,945 INFO L705 BuchiCegarLoop]: Abstraction has 1362 states and 1927 transitions. [2019-01-02 00:09:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states and 1927 transitions. [2019-01-02 00:09:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2019-01-02 00:09:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-01-02 00:09:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1927 transitions. [2019-01-02 00:09:04,968 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 1927 transitions. [2019-01-02 00:09:04,968 INFO L608 BuchiCegarLoop]: Abstraction has 1362 states and 1927 transitions. [2019-01-02 00:09:04,968 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-02 00:09:04,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 1927 transitions. [2019-01-02 00:09:04,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2019-01-02 00:09:04,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:04,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:04,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:04,979 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] [2019-01-02 00:09:04,979 INFO L794 eck$LassoCheckResult]: Stem: 66280#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 65991#L-1 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;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;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; 65992#L116-2 assume !!(add_history_type_~var~0 < 3); 66359#L117 assume 0 == add_history_type_~history_id;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; 66220#L171 assume 0 == read_history_bool_~history_id; 66221#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 65961#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 66206#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 66207#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; 66388#L116-2 assume !(add_history_type_~var~0 < 3); 66386#L116-3 add_history_type_#res := 1; 66241#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 66242#L255 assume !(0 == init_~tmp~1);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; 66344#L116-6 assume !!(add_history_type_~var~0 < 3); 66342#L117-2 assume !(0 == add_history_type_~history_id); 66343#L123-2 assume 1 == add_history_type_~history_id;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; 66387#L171-4 assume !(0 == read_history_bool_~history_id); 66292#L181-4 assume 1 == read_history_bool_~history_id; 66293#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 66193#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 66032#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 66033#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; 66399#L116-6 assume !(add_history_type_~var~0 < 3); 66396#L116-7 add_history_type_#res := 1; 66288#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 66234#L259 assume !(0 == init_~tmp___0~1);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; 66235#L116-10 assume !!(add_history_type_~var~0 < 3); 66338#L117-4 assume !(0 == add_history_type_~history_id); 66340#L123-4 assume !(1 == add_history_type_~history_id); 66420#L129-4 assume 2 == add_history_type_~history_id;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; 66397#L171-8 assume !(0 == read_history_bool_~history_id); 66301#L181-8 assume !(1 == read_history_bool_~history_id); 66047#L191-8 assume 2 == read_history_bool_~history_id; 66048#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 66209#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 66003#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 66004#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; 66405#L116-10 assume !(add_history_type_~var~0 < 3); 66379#L116-11 add_history_type_#res := 1; 66283#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 65975#L263 assume !(0 == init_~tmp___1~1);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; 65976#L116-14 assume !!(add_history_type_~var~0 < 3); 66322#L117-6 assume !(0 == add_history_type_~history_id); 66324#L123-6 assume !(1 == add_history_type_~history_id); 66412#L129-6 assume !(2 == add_history_type_~history_id); 66176#L135-9 assume 3 == add_history_type_~history_id;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; 66177#L151-3 assume 3 == read_history_int8_~history_id; 66194#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 66195#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 66202#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 66172#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; 66173#L116-14 assume !(add_history_type_~var~0 < 3); 66370#L116-15 add_history_type_#res := 1; 66281#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 66282#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 66238#L270 main_#t~ret57 := init_#res;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; 66239#L550-2 assume !!(main_~i2~0 < 10);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;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; 66468#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; 66447#L570-16 assume 0 != ~gate1Failed~0 % 256; 66445#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 66446#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; 67002#L409 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;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; 67001#L226-2 assume !(0 == write_history_bool_~history_id); 66999#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; 66997#L570-17 assume 0 != ~gate2Failed~0 % 256; 66704#L422 [2019-01-02 00:09:04,979 INFO L796 eck$LassoCheckResult]: Loop: 66704#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 66703#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; 66698#L440 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;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; 66696#L226-4 assume !(0 == write_history_bool_~history_id); 66694#L231-4 assume !(1 == write_history_bool_~history_id); 66692#L236-4 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; 66689#L570-18 assume !(0 != ~gate3Failed~0 % 256);gate3_each_pals_period_~tmp~5 := gate3_each_pals_period_#t~nondet37;havoc gate3_each_pals_period_#t~nondet37;gate3_each_pals_period_~next_state~2 := gate3_each_pals_period_~tmp~5; 66680#L458 assume 0 == gate3_each_pals_period_~next_state~2;gate3_each_pals_period_~tmp___0~5 := 1; 66679#L464-2 assume 0 != (if 0 == gate3_each_pals_period_~tmp___0~5 then 0 else 1) % 256; 66678#L470 assume gate3_each_pals_period_~next_state~2 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0;gate3_each_pals_period_#t~ite38 := gate3_each_pals_period_~next_state~2; 66674#L470-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite38 % 256 <= 127 then gate3_each_pals_period_#t~ite38 % 256 else gate3_each_pals_period_#t~ite38 % 256 - 256);havoc gate3_each_pals_period_#t~ite38; 66672#L471 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; 66670#L486 assume ~VALUE1~0 == ~VALUE2~0; 66653#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 66646#L570-19 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; 66643#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; 66640#L570-20 ~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;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; 66639#L294 assume !(0 == ~gate1Failed~0 % 256); 66637#L297 assume !(0 == ~gate2Failed~0 % 256); 66634#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 66632#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 66628#L171-12 assume 0 == read_history_bool_~history_id; 66629#L172-12 assume !(0 == read_history_bool_~historyIndex); 66619#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 66615#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 66613#L307 assume !(0 == check_~tmp___3~0 % 256); 66528#L307-1 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; 66884#L151-7 assume 3 == read_history_int8_~history_id; 66882#L152-7 assume !(0 == read_history_int8_~historyIndex); 66879#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 66877#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 66874#L346 assume !(check_~tmp___10~0 > -2); 66523#L346-1 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; 66870#L151-9 assume 3 == read_history_int8_~history_id; 66867#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 66866#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 66865#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 66524#L366-1 check_#res := 1; 66166#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 66167#L575-72 assume !(0 == assert_~arg % 256); 66034#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 66035#L550-2 assume !!(main_~i2~0 < 10);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;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; 66226#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; 66180#L570-16 assume 0 != ~gate1Failed~0 % 256; 66182#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 66223#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; 66236#L409 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;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; 66725#L226-2 assume !(0 == write_history_bool_~history_id); 66710#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; 66705#L570-17 assume 0 != ~gate2Failed~0 % 256; 66704#L422 [2019-01-02 00:09:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1268929072, now seen corresponding path program 1 times [2019-01-02 00:09:04,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:04,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:04,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:04,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:04,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:09:05,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:09:05,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:09:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:05,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:09:05,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:09:05,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:09:05,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1720532014, now seen corresponding path program 1 times [2019-01-02 00:09:05,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:05,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:06,516 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 261 DAG size of output: 228 [2019-01-02 00:09:09,573 WARN L181 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 195 DAG size of output: 176 [2019-01-02 00:09:09,577 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:09,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:09,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:09,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:09,578 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:09,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:09,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:09,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:09,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration23_Loop [2019-01-02 00:09:09,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:09,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:09,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:09,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,240 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-02 00:09:10,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,545 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-02 00:09:10,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:10,782 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-02 00:09:11,025 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:09:11,488 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-02 00:09:15,661 WARN L181 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2019-01-02 00:09:15,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:15,729 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:15,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:15,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:15,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:09:15,745 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:09:15,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:15,769 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:15,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:09:15,797 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=128, ~gate1Failed_History_0~0=128, ULTIMATE.start_check_~tmp___3~0=128, ULTIMATE.start_read_history_bool_#res=128, ~gate1Failed_History_1~0=128, ~gate1Failed_History_2~0=128} Honda state: {~gate1Failed~0=128, ~gate1Failed_History_0~0=128, ULTIMATE.start_check_~tmp___3~0=128, ULTIMATE.start_read_history_bool_#res=128, ~gate1Failed_History_1~0=128, ~gate1Failed_History_2~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:09:15,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:15,821 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:15,827 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:09:15,827 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:09:15,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:15,847 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:15,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:09:15,855 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret25=0} Honda state: {ULTIMATE.start_check_#t~ret25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:09:15,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:15,877 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:09:15,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:15,904 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:16,066 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:16,068 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:16,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:16,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:16,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:16,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:16,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:16,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:16,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:16,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration23_Loop [2019-01-02 00:09:16,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:16,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:16,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,383 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-02 00:09:16,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:16,920 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:09:17,218 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-02 00:09:17,536 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-02 00:09:21,458 WARN L181 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2019-01-02 00:09:21,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:21,694 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:21,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 [2019-01-02 00:09:21,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:21,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:21,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:21,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:21,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:21,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:21,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:21,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:21,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:21,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:21,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:21,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:21,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:21,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:21,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:21,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:21,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:21,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 [2019-01-02 00:09:21,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:21,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:21,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:21,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:21,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:21,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:21,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:21,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:21,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:21,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:21,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:21,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:21,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:21,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:21,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:21,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:21,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:21,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:21,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:21,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:21,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:21,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:21,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:21,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:21,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:21,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:21,718 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:21,718 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:21,718 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:21,719 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:21,722 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:21,722 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:09:21,722 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:21,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:21,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:22,010 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 [2019-01-02 00:09:22,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1362 states and 1927 transitions. cyclomatic complexity: 573 Second operand 5 states. [2019-01-02 00:09:22,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1362 states and 1927 transitions. cyclomatic complexity: 573. Second operand 5 states. Result 3692 states and 5242 transitions. Complement of second has 6 states. [2019-01-02 00:09:22,057 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 [2019-01-02 00:09:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:09:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2019-01-02 00:09:22,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 591 transitions. Stem has 65 letters. Loop has 50 letters. [2019-01-02 00:09:22,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:22,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 591 transitions. Stem has 115 letters. Loop has 50 letters. [2019-01-02 00:09:22,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:22,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 591 transitions. Stem has 65 letters. Loop has 100 letters. [2019-01-02 00:09:22,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:22,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3692 states and 5242 transitions. [2019-01-02 00:09:22,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 432 [2019-01-02 00:09:22,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3692 states to 1158 states and 1619 transitions. [2019-01-02 00:09:22,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 790 [2019-01-02 00:09:22,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 790 [2019-01-02 00:09:22,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1158 states and 1619 transitions. [2019-01-02 00:09:22,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:09:22,101 INFO L705 BuchiCegarLoop]: Abstraction has 1158 states and 1619 transitions. [2019-01-02 00:09:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states and 1619 transitions. [2019-01-02 00:09:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2019-01-02 00:09:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-01-02 00:09:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1619 transitions. [2019-01-02 00:09:22,138 INFO L728 BuchiCegarLoop]: Abstraction has 1158 states and 1619 transitions. [2019-01-02 00:09:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:09:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:09:22,138 INFO L87 Difference]: Start difference. First operand 1158 states and 1619 transitions. Second operand 5 states. [2019-01-02 00:09:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:22,467 INFO L93 Difference]: Finished difference Result 1304 states and 1809 transitions. [2019-01-02 00:09:22,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:09:22,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1304 states and 1809 transitions. [2019-01-02 00:09:22,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 432 [2019-01-02 00:09:22,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1304 states to 1281 states and 1781 transitions. [2019-01-02 00:09:22,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 811 [2019-01-02 00:09:22,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 811 [2019-01-02 00:09:22,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1281 states and 1781 transitions. [2019-01-02 00:09:22,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:09:22,482 INFO L705 BuchiCegarLoop]: Abstraction has 1281 states and 1781 transitions. [2019-01-02 00:09:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 1781 transitions. [2019-01-02 00:09:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1187. [2019-01-02 00:09:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-01-02 00:09:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1658 transitions. [2019-01-02 00:09:22,494 INFO L728 BuchiCegarLoop]: Abstraction has 1187 states and 1658 transitions. [2019-01-02 00:09:22,494 INFO L608 BuchiCegarLoop]: Abstraction has 1187 states and 1658 transitions. [2019-01-02 00:09:22,494 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-02 00:09:22,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1187 states and 1658 transitions. [2019-01-02 00:09:22,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 432 [2019-01-02 00:09:22,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:22,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:22,500 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-02 00:09:22,500 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] [2019-01-02 00:09:22,500 INFO L794 eck$LassoCheckResult]: Stem: 74347#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 74069#L-1 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;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;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; 74070#L116-2 assume !!(add_history_type_~var~0 < 3); 74450#L117 assume 0 == add_history_type_~history_id;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; 75211#L171 assume 0 == read_history_bool_~history_id; 75206#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 75203#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 75202#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 74464#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; 74451#L116-2 assume !!(add_history_type_~var~0 < 3); 74421#L117 assume 0 == add_history_type_~history_id;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; 74283#L171 assume 0 == read_history_bool_~history_id; 74284#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 74039#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 74269#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 74270#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; 74506#L116-2 assume !(add_history_type_~var~0 < 3); 74448#L116-3 add_history_type_#res := 1; 74305#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 74306#L255 assume !(0 == init_~tmp~1);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; 74408#L116-6 assume !!(add_history_type_~var~0 < 3); 74462#L117-2 assume !(0 == add_history_type_~history_id); 74657#L123-2 assume 1 == add_history_type_~history_id;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; 74656#L171-4 assume !(0 == read_history_bool_~history_id); 74655#L181-4 assume 1 == read_history_bool_~history_id; 74650#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 74647#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 74560#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 74468#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; 74463#L116-6 assume !!(add_history_type_~var~0 < 3); 74406#L117-2 assume !(0 == add_history_type_~history_id); 74407#L123-2 assume 1 == add_history_type_~history_id;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; 74449#L171-4 assume !(0 == read_history_bool_~history_id); 74360#L181-4 assume 1 == read_history_bool_~history_id; 74361#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 74256#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 74111#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 74112#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; 74507#L116-6 assume !(add_history_type_~var~0 < 3); 74459#L116-7 add_history_type_#res := 1; 74355#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 74293#L259 assume !(0 == init_~tmp___0~1);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; 74294#L116-10 assume !!(add_history_type_~var~0 < 3); 74402#L117-4 assume !(0 == add_history_type_~history_id); 74403#L123-4 assume !(1 == add_history_type_~history_id); 74482#L129-4 assume 2 == add_history_type_~history_id;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; 74461#L171-8 assume !(0 == read_history_bool_~history_id); 74368#L181-8 assume !(1 == read_history_bool_~history_id); 74128#L191-8 assume 2 == read_history_bool_~history_id; 74129#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 74274#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 74083#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 74084#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; 74458#L116-10 assume !!(add_history_type_~var~0 < 3); 74404#L117-4 assume !(0 == add_history_type_~history_id); 74405#L123-4 assume !(1 == add_history_type_~history_id); 74481#L129-4 assume 2 == add_history_type_~history_id;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; 74460#L171-8 assume !(0 == read_history_bool_~history_id); 74367#L181-8 assume !(1 == read_history_bool_~history_id); 74125#L191-8 assume 2 == read_history_bool_~history_id; 74126#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 74272#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 74081#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 74082#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; 74467#L116-10 assume !(add_history_type_~var~0 < 3); 74441#L116-11 add_history_type_#res := 1; 74350#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 74053#L263 assume !(0 == init_~tmp___1~1);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; 74054#L116-14 assume !!(add_history_type_~var~0 < 3); 74389#L117-6 assume !(0 == add_history_type_~history_id); 74390#L123-6 assume !(1 == add_history_type_~history_id); 74474#L129-6 assume !(2 == add_history_type_~history_id); 74241#L135-9 assume 3 == add_history_type_~history_id;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; 74242#L151-3 assume 3 == read_history_int8_~history_id; 74260#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 74261#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 74266#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 74237#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; 74238#L116-14 assume !!(add_history_type_~var~0 < 3); 74391#L117-6 assume !(0 == add_history_type_~history_id); 74392#L123-6 assume !(1 == add_history_type_~history_id); 74473#L129-6 assume !(2 == add_history_type_~history_id); 74239#L135-9 assume 3 == add_history_type_~history_id;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; 74240#L151-3 assume 3 == read_history_int8_~history_id; 74257#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 74258#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 74265#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 74235#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; 74236#L116-14 assume !(add_history_type_~var~0 < 3); 74432#L116-15 add_history_type_#res := 1; 74348#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 74349#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 74299#L270 main_#t~ret57 := init_#res;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; 74300#L550-2 assume !!(main_~i2~0 < 10);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;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; 74559#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; 74788#L570-16 assume 0 != ~gate1Failed~0 % 256; 74504#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 74286#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; 74301#L409 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;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; 75201#L226-2 assume !(0 == write_history_bool_~history_id); 74308#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; 74188#L570-17 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; 74189#L427 assume !(0 == gate2_each_pals_period_~next_state~1); 74444#L430 [2019-01-02 00:09:22,500 INFO L796 eck$LassoCheckResult]: Loop: 74444#L430 assume 1 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 74210#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 74988#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 74108#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; 74987#L440 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;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; 74986#L226-4 assume !(0 == write_history_bool_~history_id); 74985#L231-4 assume !(1 == write_history_bool_~history_id); 74984#L236-4 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; 74982#L570-18 assume 0 != ~gate3Failed~0 % 256; 74981#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 74979#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; 74977#L471 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; 74975#L486 assume ~VALUE1~0 == ~VALUE2~0; 74962#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 74959#L570-19 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; 74957#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; 74955#L570-20 ~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;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; 74954#L294 assume !(0 == ~gate1Failed~0 % 256); 74922#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 74920#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 74918#L171-12 assume 0 == read_history_bool_~history_id; 74917#L172-12 assume !(0 == read_history_bool_~historyIndex); 74916#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 74913#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 74904#L307 assume !(0 == check_~tmp___3~0 % 256); 74881#L307-1 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; 74902#L151-7 assume 3 == read_history_int8_~history_id; 74901#L152-7 assume !(0 == read_history_int8_~historyIndex); 74898#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 74897#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 74896#L346 assume !(check_~tmp___10~0 > -2); 74875#L346-1 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; 74894#L151-9 assume 3 == read_history_int8_~history_id; 74893#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 74892#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 74658#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 74386#L366-1 check_#res := 1; 74873#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 74872#L575-72 assume !(0 == assert_~arg % 256); 74871#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 74870#L550-2 assume !!(main_~i2~0 < 10);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;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; 74866#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; 74863#L570-16 assume 0 != ~gate1Failed~0 % 256; 74864#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 74999#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; 74998#L409 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;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; 74997#L226-2 assume !(0 == write_history_bool_~history_id); 74994#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; 74990#L570-17 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; 74989#L427 assume !(0 == gate2_each_pals_period_~next_state~1); 74444#L430 [2019-01-02 00:09:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1404668973, now seen corresponding path program 1 times [2019-01-02 00:09:22,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:22,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:22,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:22,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:22,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-02 00:09:22,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:09:22,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:09:22,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:22,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-02 00:09:22,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:09:22,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:09:22,880 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash 879409804, now seen corresponding path program 1 times [2019-01-02 00:09:22,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:22,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:22,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:22,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:22,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:24,029 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 263 DAG size of output: 230 [2019-01-02 00:09:26,912 WARN L181 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 195 DAG size of output: 176 [2019-01-02 00:09:26,917 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:26,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:26,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:26,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:26,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:26,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:26,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:26,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:26,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration24_Loop [2019-01-02 00:09:26,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:26,918 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:26,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:26,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:27,543 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-01-02 00:09:27,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:28,520 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:09:29,082 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-02 00:09:29,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:09:37,290 WARN L181 SmtUtils]: Spent 7.94 s on a formula simplification. DAG size of input: 193 DAG size of output: 141 [2019-01-02 00:09:37,299 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:37,299 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:09:37,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:37,307 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:37,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:37,337 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:37,492 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:37,494 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:37,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:37,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:37,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:37,495 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:37,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:37,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:37,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:37,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration24_Loop [2019-01-02 00:09:37,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:37,496 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:37,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:37,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,230 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-01-02 00:09:38,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,513 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:09:39,065 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-02 00:09:39,074 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:09:47,024 WARN L181 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 193 DAG size of output: 141 [2019-01-02 00:09:47,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:47,042 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:47,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:47,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:47,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:47,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:47,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:47,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:47,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:47,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:47,046 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:47,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:47,049 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:47,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:47,050 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:47,050 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:47,050 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:09:47,050 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:47,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:47,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:47,302 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 [2019-01-02 00:09:47,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1187 states and 1658 transitions. cyclomatic complexity: 479 Second operand 5 states. [2019-01-02 00:09:47,342 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1187 states and 1658 transitions. cyclomatic complexity: 479. Second operand 5 states. Result 3307 states and 4656 transitions. Complement of second has 6 states. [2019-01-02 00:09:47,345 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 [2019-01-02 00:09:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:09:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2019-01-02 00:09:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 584 transitions. Stem has 103 letters. Loop has 50 letters. [2019-01-02 00:09:47,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:47,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 584 transitions. Stem has 153 letters. Loop has 50 letters. [2019-01-02 00:09:47,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:47,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 584 transitions. Stem has 103 letters. Loop has 100 letters. [2019-01-02 00:09:47,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:47,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3307 states and 4656 transitions. [2019-01-02 00:09:47,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:09:47,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3307 states to 1177 states and 1631 transitions. [2019-01-02 00:09:47,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2019-01-02 00:09:47,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2019-01-02 00:09:47,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1177 states and 1631 transitions. [2019-01-02 00:09:47,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:09:47,390 INFO L705 BuchiCegarLoop]: Abstraction has 1177 states and 1631 transitions. [2019-01-02 00:09:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states and 1631 transitions. [2019-01-02 00:09:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2019-01-02 00:09:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2019-01-02 00:09:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1631 transitions. [2019-01-02 00:09:47,413 INFO L728 BuchiCegarLoop]: Abstraction has 1177 states and 1631 transitions. [2019-01-02 00:09:47,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:09:47,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:09:47,413 INFO L87 Difference]: Start difference. First operand 1177 states and 1631 transitions. Second operand 6 states. [2019-01-02 00:09:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:47,631 INFO L93 Difference]: Finished difference Result 1277 states and 1758 transitions. [2019-01-02 00:09:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:09:47,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 1758 transitions. [2019-01-02 00:09:47,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:09:47,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1254 states and 1730 transitions. [2019-01-02 00:09:47,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2019-01-02 00:09:47,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2019-01-02 00:09:47,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1254 states and 1730 transitions. [2019-01-02 00:09:47,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:09:47,643 INFO L705 BuchiCegarLoop]: Abstraction has 1254 states and 1730 transitions. [2019-01-02 00:09:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states and 1730 transitions. [2019-01-02 00:09:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1231. [2019-01-02 00:09:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-01-02 00:09:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1702 transitions. [2019-01-02 00:09:47,656 INFO L728 BuchiCegarLoop]: Abstraction has 1231 states and 1702 transitions. [2019-01-02 00:09:47,656 INFO L608 BuchiCegarLoop]: Abstraction has 1231 states and 1702 transitions. [2019-01-02 00:09:47,656 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-02 00:09:47,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1231 states and 1702 transitions. [2019-01-02 00:09:47,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:09:47,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:47,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:47,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-01-02 00:09:47,660 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] [2019-01-02 00:09:47,661 INFO L794 eck$LassoCheckResult]: Stem: 82069#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 81808#L-1 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;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;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; 81809#L116-2 assume !!(add_history_type_~var~0 < 3); 82138#L117 assume 0 == add_history_type_~history_id;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; 82013#L171 assume 0 == read_history_bool_~history_id; 82014#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 81778#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 81999#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 82000#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; 82158#L116-2 assume !!(add_history_type_~var~0 < 3); 82159#L117 assume 0 == add_history_type_~history_id;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; 82252#L171 assume 0 == read_history_bool_~history_id; 82246#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 82242#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 82238#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 82237#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; 82236#L116-2 assume !!(add_history_type_~var~0 < 3); 82212#L117 assume 0 == add_history_type_~history_id;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; 82234#L171 assume 0 == read_history_bool_~history_id; 82224#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 82220#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 82218#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 82216#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; 82211#L116-2 assume !(add_history_type_~var~0 < 3); 82156#L116-3 add_history_type_#res := 1; 82033#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 82034#L255 assume !(0 == init_~tmp~1);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; 82126#L116-6 assume !!(add_history_type_~var~0 < 3); 82124#L117-2 assume !(0 == add_history_type_~history_id); 82125#L123-2 assume 1 == add_history_type_~history_id;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; 82157#L171-4 assume !(0 == read_history_bool_~history_id); 82082#L181-4 assume 1 == read_history_bool_~history_id; 82083#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 81986#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 81844#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 81845#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; 82168#L116-6 assume !!(add_history_type_~var~0 < 3); 82169#L117-2 assume !(0 == add_history_type_~history_id); 82267#L123-2 assume 1 == add_history_type_~history_id;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; 82266#L171-4 assume !(0 == read_history_bool_~history_id); 82265#L181-4 assume 1 == read_history_bool_~history_id; 82260#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 82257#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 82256#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 82255#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; 82254#L116-6 assume !!(add_history_type_~var~0 < 3); 82214#L117-2 assume !(0 == add_history_type_~history_id); 82249#L123-2 assume 1 == add_history_type_~history_id;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; 82243#L171-4 assume !(0 == read_history_bool_~history_id); 82241#L181-4 assume 1 == read_history_bool_~history_id; 82229#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 82221#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 82219#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 82217#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; 82213#L116-6 assume !(add_history_type_~var~0 < 3); 82165#L116-7 add_history_type_#res := 1; 82077#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 82023#L259 assume !(0 == init_~tmp___0~1);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; 82024#L116-10 assume !!(add_history_type_~var~0 < 3); 82120#L117-4 assume !(0 == add_history_type_~history_id); 82121#L123-4 assume !(1 == add_history_type_~history_id); 82294#L129-4 assume 2 == add_history_type_~history_id;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; 82293#L171-8 assume !(0 == read_history_bool_~history_id); 82292#L181-8 assume !(1 == read_history_bool_~history_id); 82290#L191-8 assume 2 == read_history_bool_~history_id; 82287#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 82286#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 82285#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 82284#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; 82164#L116-10 assume !!(add_history_type_~var~0 < 3); 82122#L117-4 assume !(0 == add_history_type_~history_id); 82123#L123-4 assume !(1 == add_history_type_~history_id); 82193#L129-4 assume 2 == add_history_type_~history_id;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; 82167#L171-8 assume !(0 == read_history_bool_~history_id); 82089#L181-8 assume !(1 == read_history_bool_~history_id); 81864#L191-8 assume 2 == read_history_bool_~history_id; 81865#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 82004#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 81822#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 81823#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; 82178#L116-10 assume !!(add_history_type_~var~0 < 3); 82269#L117-4 assume !(0 == add_history_type_~history_id); 82206#L123-4 assume !(1 == add_history_type_~history_id); 82192#L129-4 assume 2 == add_history_type_~history_id;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; 82166#L171-8 assume !(0 == read_history_bool_~history_id); 82088#L181-8 assume !(1 == read_history_bool_~history_id); 81861#L191-8 assume 2 == read_history_bool_~history_id; 81862#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 82002#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 81820#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 81821#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; 82177#L116-10 assume !(add_history_type_~var~0 < 3); 82153#L116-11 add_history_type_#res := 1; 82072#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 81792#L263 assume !(0 == init_~tmp___1~1);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; 81793#L116-14 assume !!(add_history_type_~var~0 < 3); 82109#L117-6 assume !(0 == add_history_type_~history_id); 82110#L123-6 assume !(1 == add_history_type_~history_id); 82282#L129-6 assume !(2 == add_history_type_~history_id); 82281#L135-9 assume 3 == add_history_type_~history_id;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; 82280#L151-3 assume 3 == read_history_int8_~history_id; 82279#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 82277#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 82276#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 82275#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; 82148#L116-14 assume !!(add_history_type_~var~0 < 3); 82111#L117-6 assume !(0 == add_history_type_~history_id); 82112#L123-6 assume !(1 == add_history_type_~history_id); 82184#L129-6 assume !(2 == add_history_type_~history_id); 81973#L135-9 assume 3 == add_history_type_~history_id;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; 81974#L151-3 assume 3 == read_history_int8_~history_id; 81990#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 81991#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 81996#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 81969#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; 81970#L116-14 assume !!(add_history_type_~var~0 < 3); 82268#L117-6 assume !(0 == add_history_type_~history_id); 82205#L123-6 assume !(1 == add_history_type_~history_id); 82183#L129-6 assume !(2 == add_history_type_~history_id); 81971#L135-9 assume 3 == add_history_type_~history_id;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; 81972#L151-3 assume 3 == read_history_int8_~history_id; 81987#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 81988#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 81995#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 81967#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; 81968#L116-14 assume !(add_history_type_~var~0 < 3); 82147#L116-15 add_history_type_#res := 1; 82070#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 82071#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 82029#L270 main_#t~ret57 := init_#res;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; 82030#L550-2 assume !!(main_~i2~0 < 10);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;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; 82283#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; 82455#L570-16 assume 0 != ~gate1Failed~0 % 256; 82209#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 82210#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; 82844#L409 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;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; 82843#L226-2 assume !(0 == write_history_bool_~history_id); 82841#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; 82839#L570-17 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; 82838#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 82836#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 82834#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; 81847#L439-2 [2019-01-02 00:09:47,661 INFO L796 eck$LassoCheckResult]: Loop: 81847#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; 81854#L440 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;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; 82080#L226-4 assume !(0 == write_history_bool_~history_id); 82073#L231-4 assume !(1 == write_history_bool_~history_id); 82074#L236-4 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; 81929#L570-18 assume 0 != ~gate3Failed~0 % 256; 81931#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 82116#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; 82117#L471 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; 82129#L486 assume ~VALUE1~0 == ~VALUE2~0; 82131#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 81832#L570-19 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; 81938#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; 81895#L570-20 ~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;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; 81946#L294 assume !(0 == ~gate1Failed~0 % 256); 82061#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 82062#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 82162#L171-12 assume 0 == read_history_bool_~history_id; 82127#L172-12 assume !(0 == read_history_bool_~historyIndex); 82105#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 81955#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 81814#L307 assume !(0 == check_~tmp___3~0 % 256); 81815#L307-1 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; 81824#L151-7 assume 3 == read_history_int8_~history_id; 81890#L152-7 assume !(0 == read_history_int8_~historyIndex); 81891#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 81896#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 81897#L346 assume !(check_~tmp___10~0 > -2); 82094#L346-1 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; 82095#L151-9 assume 3 == read_history_int8_~history_id; 81873#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 81874#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 82295#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 81984#L366-1 check_#res := 1; 81960#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 81961#L575-72 assume !(0 == assert_~arg % 256); 81850#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 81851#L550-2 assume !!(main_~i2~0 < 10);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;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; 82019#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; 81975#L570-16 assume 0 != ~gate1Failed~0 % 256; 81977#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 82016#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; 82031#L409 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;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; 82940#L226-2 assume !(0 == write_history_bool_~history_id); 82938#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; 81925#L570-17 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; 81926#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 81965#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 81846#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 81847#L439-2 [2019-01-02 00:09:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash -612402622, now seen corresponding path program 1 times [2019-01-02 00:09:47,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:47,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:47,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:47,859 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2019-01-02 00:09:48,142 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-01-02 00:09:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:09:48,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:48,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:48,186 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1853056999, now seen corresponding path program 2 times [2019-01-02 00:09:48,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:49,372 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 259 DAG size of output: 226 [2019-01-02 00:09:54,893 WARN L181 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 195 DAG size of output: 184 [2019-01-02 00:09:54,898 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:54,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:54,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:54,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:54,899 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:54,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:54,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:54,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:54,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration25_Loop [2019-01-02 00:09:54,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:54,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:54,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:09:55,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,350 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-01-02 00:09:55,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:55,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:56,132 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-01-02 00:09:56,395 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:09:56,537 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-02 00:10:05,811 WARN L181 SmtUtils]: Spent 9.14 s on a formula simplification. DAG size of input: 257 DAG size of output: 141 [2019-01-02 00:10:06,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:10:06,056 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:06,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:06,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:06,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:06,071 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_21=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_21=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:06,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:06,091 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:06,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:06,102 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:06,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:06,123 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:06,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:06,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate3Failed_History_1~0=64, ~gate3Failed_History_2~0=64, ~gate3Failed_History_0~0=64, ~gate3Failed~0=64} Honda state: {~gate3Failed_History_1~0=64, ~gate3Failed_History_2~0=64, ~gate3Failed_History_0~0=64, ~gate3Failed~0=64} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:06,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:06,166 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:06,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:06,174 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:06,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:06,197 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:06,203 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:06,203 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:06,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:06,225 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:06,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:10:06,825 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:19,264 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:10:19,283 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:10:19,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:10:19,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:10:19,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:10:19,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:10:19,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:19,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:10:19,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:10:19,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration25_Loop [2019-01-02 00:10:19,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:10:19,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:10:19,288 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:10:19,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,937 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-01-02 00:10:19,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:19,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:20,691 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-01-02 00:10:20,866 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:10:20,934 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-02 00:10:30,347 WARN L181 SmtUtils]: Spent 9.29 s on a formula simplification. DAG size of input: 257 DAG size of output: 141 [2019-01-02 00:10:30,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:10:30,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:10:30,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:30,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:30,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:30,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:30,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:30,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:30,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:30,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:30,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 [2019-01-02 00:10:30,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:30,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:30,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:30,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:30,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:30,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:30,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:30,541 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:10:30,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:10:30,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:10:30,542 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:10:30,542 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:10:30,542 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:10:30,542 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:10:30,543 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:10:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:10:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:30,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:10:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:30,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:10:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:10:31,034 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 [2019-01-02 00:10:31,034 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1231 states and 1702 transitions. cyclomatic complexity: 479 Second operand 5 states. [2019-01-02 00:10:31,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1231 states and 1702 transitions. cyclomatic complexity: 479. Second operand 5 states. Result 3337 states and 4648 transitions. Complement of second has 6 states. [2019-01-02 00:10:31,077 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 [2019-01-02 00:10:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:10:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2019-01-02 00:10:31,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 577 transitions. Stem has 142 letters. Loop has 49 letters. [2019-01-02 00:10:31,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:10:31,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 577 transitions. Stem has 191 letters. Loop has 49 letters. [2019-01-02 00:10:31,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:10:31,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 577 transitions. Stem has 142 letters. Loop has 98 letters. [2019-01-02 00:10:31,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:10:31,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3337 states and 4648 transitions. [2019-01-02 00:10:31,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:10:31,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3337 states to 1231 states and 1695 transitions. [2019-01-02 00:10:31,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2019-01-02 00:10:31,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2019-01-02 00:10:31,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1231 states and 1695 transitions. [2019-01-02 00:10:31,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:10:31,097 INFO L705 BuchiCegarLoop]: Abstraction has 1231 states and 1695 transitions. [2019-01-02 00:10:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states and 1695 transitions. [2019-01-02 00:10:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1231. [2019-01-02 00:10:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-01-02 00:10:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1695 transitions. [2019-01-02 00:10:31,111 INFO L728 BuchiCegarLoop]: Abstraction has 1231 states and 1695 transitions. [2019-01-02 00:10:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:10:31,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:10:31,111 INFO L87 Difference]: Start difference. First operand 1231 states and 1695 transitions. Second operand 5 states. [2019-01-02 00:10:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:10:31,200 INFO L93 Difference]: Finished difference Result 1231 states and 1695 transitions. [2019-01-02 00:10:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:10:31,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1231 states and 1695 transitions. [2019-01-02 00:10:31,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:10:31,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1231 states to 1231 states and 1695 transitions. [2019-01-02 00:10:31,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2019-01-02 00:10:31,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2019-01-02 00:10:31,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1231 states and 1695 transitions. [2019-01-02 00:10:31,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:10:31,212 INFO L705 BuchiCegarLoop]: Abstraction has 1231 states and 1695 transitions. [2019-01-02 00:10:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states and 1695 transitions. [2019-01-02 00:10:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1231. [2019-01-02 00:10:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-01-02 00:10:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1695 transitions. [2019-01-02 00:10:31,227 INFO L728 BuchiCegarLoop]: Abstraction has 1231 states and 1695 transitions. [2019-01-02 00:10:31,227 INFO L608 BuchiCegarLoop]: Abstraction has 1231 states and 1695 transitions. [2019-01-02 00:10:31,227 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2019-01-02 00:10:31,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1231 states and 1695 transitions. [2019-01-02 00:10:31,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2019-01-02 00:10:31,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:10:31,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:10:31,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-01-02 00:10:31,233 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] [2019-01-02 00:10:31,233 INFO L794 eck$LassoCheckResult]: Stem: 89706#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 89436#L-1 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;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;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; 89437#L116-2 assume !!(add_history_type_~var~0 < 3); 89776#L117 assume 0 == add_history_type_~history_id;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; 89646#L171 assume 0 == read_history_bool_~history_id; 89647#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 89406#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 89632#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 89633#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; 89796#L116-2 assume !!(add_history_type_~var~0 < 3); 89797#L117 assume 0 == add_history_type_~history_id;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; 89887#L171 assume 0 == read_history_bool_~history_id; 89881#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 89877#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 89873#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 89872#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; 89871#L116-2 assume !!(add_history_type_~var~0 < 3); 89847#L117 assume 0 == add_history_type_~history_id;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; 89869#L171 assume 0 == read_history_bool_~history_id; 89859#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 89855#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 89853#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 89851#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; 89846#L116-2 assume !(add_history_type_~var~0 < 3); 89794#L116-3 add_history_type_#res := 1; 89667#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 89668#L255 assume !(0 == init_~tmp~1);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; 89763#L116-6 assume !!(add_history_type_~var~0 < 3); 89761#L117-2 assume !(0 == add_history_type_~history_id); 89762#L123-2 assume 1 == add_history_type_~history_id;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; 89795#L171-4 assume !(0 == read_history_bool_~history_id); 89718#L181-4 assume 1 == read_history_bool_~history_id; 89719#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 89619#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 89473#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 89474#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; 89808#L116-6 assume !!(add_history_type_~var~0 < 3); 89809#L117-2 assume !(0 == add_history_type_~history_id); 89902#L123-2 assume 1 == add_history_type_~history_id;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; 89901#L171-4 assume !(0 == read_history_bool_~history_id); 89900#L181-4 assume 1 == read_history_bool_~history_id; 89895#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 89892#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 89891#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 89890#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; 89889#L116-6 assume !!(add_history_type_~var~0 < 3); 89849#L117-2 assume !(0 == add_history_type_~history_id); 89884#L123-2 assume 1 == add_history_type_~history_id;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; 89878#L171-4 assume !(0 == read_history_bool_~history_id); 89876#L181-4 assume 1 == read_history_bool_~history_id; 89864#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 89856#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 89854#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 89852#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; 89848#L116-6 assume !(add_history_type_~var~0 < 3); 89805#L116-7 add_history_type_#res := 1; 89714#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 89656#L259 assume !(0 == init_~tmp___0~1);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; 89657#L116-10 assume !!(add_history_type_~var~0 < 3); 89756#L117-4 assume !(0 == add_history_type_~history_id); 89757#L123-4 assume !(1 == add_history_type_~history_id); 89828#L129-4 assume 2 == add_history_type_~history_id;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; 89807#L171-8 assume !(0 == read_history_bool_~history_id); 89725#L181-8 assume !(1 == read_history_bool_~history_id); 89493#L191-8 assume 2 == read_history_bool_~history_id; 89494#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 89637#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 89450#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 89451#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; 89804#L116-10 assume !!(add_history_type_~var~0 < 3); 89758#L117-4 assume !(0 == add_history_type_~history_id); 89759#L123-4 assume !(1 == add_history_type_~history_id); 89929#L129-4 assume 2 == add_history_type_~history_id;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; 89924#L171-8 assume !(0 == read_history_bool_~history_id); 89923#L181-8 assume !(1 == read_history_bool_~history_id); 89921#L191-8 assume 2 == read_history_bool_~history_id; 89917#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 89915#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 89913#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 89910#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; 89908#L116-10 assume !!(add_history_type_~var~0 < 3); 89906#L117-4 assume !(0 == add_history_type_~history_id); 89842#L123-4 assume !(1 == add_history_type_~history_id); 89827#L129-4 assume 2 == add_history_type_~history_id;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; 89806#L171-8 assume !(0 == read_history_bool_~history_id); 89724#L181-8 assume !(1 == read_history_bool_~history_id); 89490#L191-8 assume 2 == read_history_bool_~history_id; 89491#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 89635#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 89448#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 89449#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; 89813#L116-10 assume !(add_history_type_~var~0 < 3); 89791#L116-11 add_history_type_#res := 1; 89709#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 89420#L263 assume !(0 == init_~tmp___1~1);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; 89421#L116-14 assume !!(add_history_type_~var~0 < 3); 89744#L117-6 assume !(0 == add_history_type_~history_id); 89745#L123-6 assume !(1 == add_history_type_~history_id); 89821#L129-6 assume !(2 == add_history_type_~history_id); 89604#L135-9 assume 3 == add_history_type_~history_id;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; 89605#L151-3 assume 3 == read_history_int8_~history_id; 89623#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 89624#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 89629#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 89600#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; 89601#L116-14 assume !!(add_history_type_~var~0 < 3); 89746#L117-6 assume !(0 == add_history_type_~history_id); 89747#L123-6 assume !(1 == add_history_type_~history_id); 89920#L129-6 assume !(2 == add_history_type_~history_id); 89916#L135-9 assume 3 == add_history_type_~history_id;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; 89914#L151-3 assume 3 == read_history_int8_~history_id; 89912#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 89909#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 89907#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 89905#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; 89904#L116-14 assume !!(add_history_type_~var~0 < 3); 89903#L117-6 assume !(0 == add_history_type_~history_id); 89841#L123-6 assume !(1 == add_history_type_~history_id); 89820#L129-6 assume !(2 == add_history_type_~history_id); 89602#L135-9 assume 3 == add_history_type_~history_id;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; 89603#L151-3 assume 3 == read_history_int8_~history_id; 89620#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 89621#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 89628#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 89598#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; 89599#L116-14 assume !(add_history_type_~var~0 < 3); 89785#L116-15 add_history_type_#res := 1; 89707#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 89708#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 89662#L270 main_#t~ret57 := init_#res;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; 89663#L550-2 assume !!(main_~i2~0 < 10);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;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; 89652#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; 89612#L570-16 assume 0 != ~gate1Failed~0 % 256; 89844#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 89845#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; 90490#L409 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;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; 90489#L226-2 assume !(0 == write_history_bool_~history_id); 90484#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; 90482#L570-17 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; 90481#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 90480#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 90479#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 90478#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; 90477#L440 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;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; 90472#L226-4 assume !(0 == write_history_bool_~history_id); 90469#L231-4 assume !(1 == write_history_bool_~history_id); 90467#L236-4 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; 90463#L570-18 assume 0 != ~gate3Failed~0 % 256; 90464#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 90503#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; 90502#L471 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; 90500#L486 assume !(~VALUE1~0 == ~VALUE2~0); 90501#L493 assume ~VALUE1~0 == ~VALUE3~0; 89460#L494 [2019-01-02 00:10:31,235 INFO L796 eck$LassoCheckResult]: Loop: 89460#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 89461#L570-19 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; 89566#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; 89523#L570-20 ~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;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; 89832#L294 assume !(0 == ~gate1Failed~0 % 256); 89833#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 90540#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 90536#L171-12 assume 0 == read_history_bool_~history_id; 90534#L172-12 assume !(0 == read_history_bool_~historyIndex); 90533#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 90528#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 90104#L307 assume !(0 == check_~tmp___3~0 % 256); 90100#L307-1 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; 90092#L151-7 assume 3 == read_history_int8_~history_id; 90091#L152-7 assume !(0 == read_history_int8_~historyIndex); 90090#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 90088#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 90089#L346 assume !(check_~tmp___10~0 > -2); 90112#L346-1 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; 90146#L151-9 assume 3 == read_history_int8_~history_id; 90135#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 90132#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 90128#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 90114#L366-1 check_#res := 1; 90101#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 90099#L575-72 assume !(0 == assert_~arg % 256); 90098#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 90097#L550-2 assume !!(main_~i2~0 < 10);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;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; 90093#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; 89606#L570-16 assume 0 != ~gate1Failed~0 % 256; 89608#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 89649#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; 89664#L409 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;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; 90588#L226-2 assume !(0 == write_history_bool_~history_id); 90584#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; 90581#L570-17 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; 90580#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 90579#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 90578#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 90577#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; 90576#L440 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;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; 90575#L226-4 assume !(0 == write_history_bool_~history_id); 90574#L231-4 assume !(1 == write_history_bool_~history_id); 90573#L236-4 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; 90571#L570-18 assume 0 != ~gate3Failed~0 % 256; 89772#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 89752#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; 89753#L471 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; 89766#L486 assume !(~VALUE1~0 == ~VALUE2~0); 89767#L493 assume ~VALUE1~0 == ~VALUE3~0; 89460#L494 [2019-01-02 00:10:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:10:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1741736011, now seen corresponding path program 1 times [2019-01-02 00:10:31,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:10:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:10:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:10:31,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:10:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:10:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:10:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:10:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:10:31,480 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:10:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:10:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1063108040, now seen corresponding path program 1 times [2019-01-02 00:10:31,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:10:31,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:10:31,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:10:31,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:10:31,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:10:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:10:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:10:32,615 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 260 DAG size of output: 227 [2019-01-02 00:10:34,421 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 191 DAG size of output: 170 [2019-01-02 00:10:34,425 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:10:34,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:10:34,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:10:34,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:10:34,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:10:34,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:34,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:10:34,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:10:34,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2019-01-02 00:10:34,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:10:34,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:10:34,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,940 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-01-02 00:10:34,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:34,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:35,568 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-01-02 00:10:35,920 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:10:39,490 WARN L181 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2019-01-02 00:10:39,858 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:10:39,858 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:39,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:39,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:39,874 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:39,874 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:39,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:39,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:39,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:39,907 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:39,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:39,930 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:39,940 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:39,940 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:39,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:39,961 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:39,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:39,972 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:40,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,015 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:40,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:40,021 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:40,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,045 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:40,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:40,057 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:40,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:40,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:40,090 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:40,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:40,124 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:40,124 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:10:40,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,145 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:40,157 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:40,157 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:40,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:40,192 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:10:40,192 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:40,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:40,219 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:10:40,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:10:40,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:10:52,752 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:10:52,766 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:10:52,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:10:52,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:10:52,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:10:52,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:10:52,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:52,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:10:52,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:10:52,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2019-01-02 00:10:52,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:10:52,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:10:52,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:52,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,285 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-01-02 00:10:53,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:53,655 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-02 00:10:54,225 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:10:54,484 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-01-02 00:10:58,207 WARN L181 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2019-01-02 00:10:58,282 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:10:58,282 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:10:58,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,625 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-02 00:10:58,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,638 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:10:58,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,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 [2019-01-02 00:10:58,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:10:58,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:10:58,792 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:10:58,792 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:10:58,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:10:58,792 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:10:58,793 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:10:58,793 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:10:58,793 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:10:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:10:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:59,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:10:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:59,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:11:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:11:00,341 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 [2019-01-02 00:11:00,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1231 states and 1695 transitions. cyclomatic complexity: 472 Second operand 5 states. [2019-01-02 00:11:00,598 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1231 states and 1695 transitions. cyclomatic complexity: 472. Second operand 5 states. Result 3336 states and 4639 transitions. Complement of second has 6 states. [2019-01-02 00:11:00,599 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 [2019-01-02 00:11:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:11:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2019-01-02 00:11:00,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 574 transitions. Stem has 153 letters. Loop has 50 letters. [2019-01-02 00:11:00,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:11:00,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 574 transitions. Stem has 203 letters. Loop has 50 letters. [2019-01-02 00:11:00,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:11:00,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 574 transitions. Stem has 153 letters. Loop has 100 letters. [2019-01-02 00:11:00,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:11:00,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3336 states and 4639 transitions. [2019-01-02 00:11:00,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 420 [2019-01-02 00:11:00,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3336 states to 1221 states and 1663 transitions. [2019-01-02 00:11:00,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2019-01-02 00:11:00,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2019-01-02 00:11:00,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1221 states and 1663 transitions. [2019-01-02 00:11:00,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:11:00,618 INFO L705 BuchiCegarLoop]: Abstraction has 1221 states and 1663 transitions. [2019-01-02 00:11:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states and 1663 transitions. [2019-01-02 00:11:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1221. [2019-01-02 00:11:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-01-02 00:11:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1663 transitions. [2019-01-02 00:11:00,630 INFO L728 BuchiCegarLoop]: Abstraction has 1221 states and 1663 transitions. [2019-01-02 00:11:00,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:11:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:11:00,630 INFO L87 Difference]: Start difference. First operand 1221 states and 1663 transitions. Second operand 4 states. [2019-01-02 00:11:00,806 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-02 00:11:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:11:01,026 INFO L93 Difference]: Finished difference Result 2249 states and 3021 transitions. [2019-01-02 00:11:01,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:11:01,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2249 states and 3021 transitions. [2019-01-02 00:11:01,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 792 [2019-01-02 00:11:01,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2249 states to 2249 states and 3021 transitions. [2019-01-02 00:11:01,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2019-01-02 00:11:01,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2019-01-02 00:11:01,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2249 states and 3021 transitions. [2019-01-02 00:11:01,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:11:01,042 INFO L705 BuchiCegarLoop]: Abstraction has 2249 states and 3021 transitions. [2019-01-02 00:11:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states and 3021 transitions. [2019-01-02 00:11:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1750. [2019-01-02 00:11:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-01-02 00:11:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2364 transitions. [2019-01-02 00:11:01,064 INFO L728 BuchiCegarLoop]: Abstraction has 1750 states and 2364 transitions. [2019-01-02 00:11:01,064 INFO L608 BuchiCegarLoop]: Abstraction has 1750 states and 2364 transitions. [2019-01-02 00:11:01,064 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2019-01-02 00:11:01,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1750 states and 2364 transitions. [2019-01-02 00:11:01,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 556 [2019-01-02 00:11:01,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:11:01,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:11:01,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-01-02 00:11:01,070 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] [2019-01-02 00:11:01,071 INFO L794 eck$LassoCheckResult]: Stem: 98380#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 98109#L-1 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;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;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; 98110#L116-2 assume !!(add_history_type_~var~0 < 3); 98454#L117 assume 0 == add_history_type_~history_id;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; 98317#L171 assume 0 == read_history_bool_~history_id; 98318#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 98079#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 98303#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 98304#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; 98478#L116-2 assume !!(add_history_type_~var~0 < 3); 98479#L117 assume 0 == add_history_type_~history_id;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; 98614#L171 assume 0 == read_history_bool_~history_id; 98612#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 98609#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 98580#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 98579#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; 98575#L116-2 assume !!(add_history_type_~var~0 < 3); 98542#L117 assume 0 == add_history_type_~history_id;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; 98572#L171 assume 0 == read_history_bool_~history_id; 98565#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 98558#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 98551#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 98548#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; 98541#L116-2 assume !(add_history_type_~var~0 < 3); 98476#L116-3 add_history_type_#res := 1; 98341#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 98342#L255 assume !(0 == init_~tmp~1);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; 98443#L116-6 assume !!(add_history_type_~var~0 < 3); 98441#L117-2 assume !(0 == add_history_type_~history_id); 98442#L123-2 assume 1 == add_history_type_~history_id;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; 98477#L171-4 assume !(0 == read_history_bool_~history_id); 98392#L181-4 assume 1 == read_history_bool_~history_id; 98393#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 98594#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 98593#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 98501#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; 98492#L116-6 assume !!(add_history_type_~var~0 < 3); 98493#L117-2 assume !(0 == add_history_type_~history_id); 98539#L123-2 assume 1 == add_history_type_~history_id;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; 98540#L171-4 assume !(0 == read_history_bool_~history_id); 98598#L181-4 assume 1 == read_history_bool_~history_id; 98480#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 98290#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 98142#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 98143#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; 98578#L116-6 assume !!(add_history_type_~var~0 < 3); 98544#L117-2 assume !(0 == add_history_type_~history_id); 98574#L123-2 assume 1 == add_history_type_~history_id;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; 98569#L171-4 assume !(0 == read_history_bool_~history_id); 98562#L181-4 assume 1 == read_history_bool_~history_id; 98555#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 98550#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 98547#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 98545#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; 98543#L116-6 assume !(add_history_type_~var~0 < 3); 98489#L116-7 add_history_type_#res := 1; 98388#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 98328#L259 assume !(0 == init_~tmp___0~1);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; 98329#L116-10 assume !!(add_history_type_~var~0 < 3); 98435#L117-4 assume !(0 == add_history_type_~history_id); 98436#L123-4 assume !(1 == add_history_type_~history_id); 98592#L129-4 assume 2 == add_history_type_~history_id;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; 98591#L171-8 assume !(0 == read_history_bool_~history_id); 98590#L181-8 assume !(1 == read_history_bool_~history_id); 98588#L191-8 assume 2 == read_history_bool_~history_id; 98585#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 98584#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 98583#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 98582#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; 98581#L116-10 assume !!(add_history_type_~var~0 < 3); 98437#L117-4 assume !(0 == add_history_type_~history_id); 98438#L123-4 assume !(1 == add_history_type_~history_id); 98516#L129-4 assume 2 == add_history_type_~history_id;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; 98491#L171-8 assume !(0 == read_history_bool_~history_id); 98400#L181-8 assume !(1 == read_history_bool_~history_id); 98162#L191-8 assume 2 == read_history_bool_~history_id; 98163#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 98308#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 98123#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 98124#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; 98487#L116-10 assume !!(add_history_type_~var~0 < 3); 98488#L117-4 assume !(0 == add_history_type_~history_id); 98538#L123-4 assume !(1 == add_history_type_~history_id); 98515#L129-4 assume 2 == add_history_type_~history_id;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; 98490#L171-8 assume !(0 == read_history_bool_~history_id); 98399#L181-8 assume !(1 == read_history_bool_~history_id); 98159#L191-8 assume 2 == read_history_bool_~history_id; 98160#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 98306#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 98121#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 98122#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; 98500#L116-10 assume !(add_history_type_~var~0 < 3); 98471#L116-11 add_history_type_#res := 1; 98383#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 98093#L263 assume !(0 == init_~tmp___1~1);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; 98094#L116-14 assume !!(add_history_type_~var~0 < 3); 98424#L117-6 assume !(0 == add_history_type_~history_id); 98425#L123-6 assume !(1 == add_history_type_~history_id); 98608#L129-6 assume !(2 == add_history_type_~history_id); 98607#L135-9 assume 3 == add_history_type_~history_id;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; 98521#L151-3 assume 3 == read_history_int8_~history_id; 98294#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 98295#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 98300#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 98271#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; 98272#L116-14 assume !!(add_history_type_~var~0 < 3); 98426#L117-6 assume !(0 == add_history_type_~history_id); 98427#L123-6 assume !(1 == add_history_type_~history_id); 98506#L129-6 assume !(2 == add_history_type_~history_id); 98275#L135-9 assume 3 == add_history_type_~history_id;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; 98276#L151-3 assume 3 == read_history_int8_~history_id; 98577#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 98568#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 98559#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 98552#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; 98549#L116-14 assume !!(add_history_type_~var~0 < 3); 98546#L117-6 assume !(0 == add_history_type_~history_id); 98537#L123-6 assume !(1 == add_history_type_~history_id); 98505#L129-6 assume !(2 == add_history_type_~history_id); 98273#L135-9 assume 3 == add_history_type_~history_id;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; 98274#L151-3 assume 3 == read_history_int8_~history_id; 98291#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 98292#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 98299#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 98269#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; 98270#L116-14 assume !(add_history_type_~var~0 < 3); 98466#L116-15 add_history_type_#res := 1; 98381#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 98382#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 98334#L270 main_#t~ret57 := init_#res;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; 98335#L550-2 assume !!(main_~i2~0 < 10);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;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; 98630#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; 98952#L570-16 assume 0 != ~gate1Failed~0 % 256; 98625#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 98336#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; 98337#L409 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;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; 99362#L226-2 assume !(0 == write_history_bool_~history_id); 99358#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; 99355#L570-17 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; 99353#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 99351#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 99349#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 99346#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; 99343#L440 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;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; 99342#L226-4 assume !(0 == write_history_bool_~history_id); 99341#L231-4 assume !(1 == write_history_bool_~history_id); 99340#L236-4 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; 99334#L570-18 assume 0 != ~gate3Failed~0 % 256; 99335#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 99477#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; 99476#L471 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; 99474#L486 assume ~VALUE1~0 == ~VALUE2~0; 99475#L487 assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0 := ~VALUE1~0; 99473#L570-19 [2019-01-02 00:11:01,071 INFO L796 eck$LassoCheckResult]: Loop: 99473#L570-19 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; 99472#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; 99470#L570-20 ~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;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; 99469#L294 assume !(0 == ~gate1Failed~0 % 256); 99452#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 99448#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 99444#L171-12 assume 0 == read_history_bool_~history_id; 99442#L172-12 assume !(0 == read_history_bool_~historyIndex); 99438#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 99433#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 99434#L307 assume !(0 == check_~tmp___3~0 % 256); 99599#L307-1 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; 99598#L151-7 assume 3 == read_history_int8_~history_id; 99597#L152-7 assume !(0 == read_history_int8_~historyIndex); 99596#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 98453#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 99595#L346 assume !(check_~tmp___10~0 > -2); 98457#L346-1 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; 99594#L151-9 assume 3 == read_history_int8_~history_id; 99593#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 98452#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 99592#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 98422#L366-1 check_#res := 1; 98990#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 99768#L575-72 assume !(0 == assert_~arg % 256); 99767#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 99766#L550-2 assume !!(main_~i2~0 < 10);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;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; 99762#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; 99761#L570-16 assume 0 != ~gate1Failed~0 % 256; 99760#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 99759#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; 99758#L409 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;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; 99757#L226-2 assume !(0 == write_history_bool_~history_id); 99755#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; 99753#L570-17 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; 99752#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 99751#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 99750#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 99749#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; 99748#L440 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;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; 99747#L226-4 assume !(0 == write_history_bool_~history_id); 99746#L231-4 assume !(1 == write_history_bool_~history_id); 99745#L236-4 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; 99743#L570-18 assume 0 != ~gate3Failed~0 % 256; 98451#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 98431#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; 98432#L471 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; 99235#L486 assume ~VALUE1~0 == ~VALUE2~0; 99236#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 99473#L570-19 [2019-01-02 00:11:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1741736265, now seen corresponding path program 1 times [2019-01-02 00:11:01,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:11:01,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:11:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:11:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:11:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:11:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:11:01,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:11:01,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:11:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1966953311, now seen corresponding path program 3 times [2019-01-02 00:11:01,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:11:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:11:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:11:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:11:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:11:02,449 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 257 DAG size of output: 224 [2019-01-02 00:11:04,163 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 188 DAG size of output: 167 [2019-01-02 00:11:04,166 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:11:04,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:11:04,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:11:04,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:11:04,166 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:11:04,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:04,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:11:04,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:11:04,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration27_Loop [2019-01-02 00:11:04,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:11:04,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:11:04,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,654 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-01-02 00:11:04,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:04,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:05,177 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:11:05,574 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-02 00:11:07,736 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-01-02 00:11:07,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:11:07,857 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:07,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:07,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:07,877 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:07,878 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:07,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:07,902 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:07,910 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:07,910 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:07,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:07,936 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:07,943 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:07,943 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:07,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:07,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:07,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:07,974 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:08,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,009 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,009 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:08,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,040 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,040 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,065 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,074 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:08,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,106 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,131 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,141 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,163 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,174 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,196 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,209 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,231 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,254 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,254 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,261 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,273 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,296 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,307 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,307 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,329 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,340 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,340 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~next_state~0=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~next_state~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:08,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,384 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,384 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,405 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,420 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,442 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,465 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,473 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,486 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,507 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,518 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,540 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,565 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=-240, ~gate1Failed_History_0~0=-240, ULTIMATE.start_check_~tmp___3~0=-240, ULTIMATE.start_read_history_bool_#res=-240, ~gate1Failed_History_1~0=-240, ~gate1Failed_History_2~0=-240} Honda state: {~gate1Failed~0=-240, ~gate1Failed_History_0~0=-240, ULTIMATE.start_check_~tmp___3~0=-240, ULTIMATE.start_read_history_bool_#res=-240, ~gate1Failed_History_1~0=-240, ~gate1Failed_History_2~0=-240} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,586 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,599 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,620 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,631 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,631 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:08,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,663 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,687 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,697 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,718 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,732 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~history_id=0, ULTIMATE.start_read_history_bool_#in~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_~history_id=0, ULTIMATE.start_read_history_bool_#in~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,756 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,767 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:08,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,800 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,823 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 156 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,834 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,856 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 157 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,868 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,888 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 158 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,898 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,898 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:08,931 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,931 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,951 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 160 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,962 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:08,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:08,984 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 161 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:08,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:08,994 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,015 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 162 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:09,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,025 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,046 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 163 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:09,068 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,068 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_25=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,075 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 164 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:09,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,087 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,109 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 165 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:09,120 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,120 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,143 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 166 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:09,153 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,153 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_25=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_25=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,173 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 167 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:09,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,184 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_25=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_25=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:09,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:09,220 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:09,220 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:09,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:09,246 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:09,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:11:09,329 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 170 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:21,569 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:11:21,583 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:11:21,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:11:21,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:11:21,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:11:21,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:11:21,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:21,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:11:21,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:11:21,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration27_Loop [2019-01-02 00:11:21,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:11:21,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:11:21,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:21,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,204 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-01-02 00:11:22,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:22,789 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:11:23,053 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-02 00:11:25,228 WARN L181 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-01-02 00:11:25,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:11:25,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:11:25,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11: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 [2019-01-02 00:11:25,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11: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 [2019-01-02 00:11:25,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11: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 [2019-01-02 00:11:25,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11: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 [2019-01-02 00:11:25,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11: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 [2019-01-02 00:11:25,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11: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 [2019-01-02 00:11:25,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:25,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:25,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,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 [2019-01-02 00:11:25,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:25,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:25,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:25,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:25,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:25,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:25,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:25,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:25,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,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 [2019-01-02 00:11:25,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:25,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:25,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:25,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:25,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:25,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:25,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:25,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:25,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:25,481 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:11:25,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:11:25,482 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:11:25,482 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:11:25,483 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:11:25,483 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:11:25,483 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:11:25,483 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:11:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:11:25,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:11:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:11:26,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:11:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:11:26,444 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 [2019-01-02 00:11:26,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1750 states and 2364 transitions. cyclomatic complexity: 622 Second operand 5 states. [2019-01-02 00:11:26,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1750 states and 2364 transitions. cyclomatic complexity: 622. Second operand 5 states. Result 3870 states and 5266 transitions. Complement of second has 6 states. [2019-01-02 00:11:26,650 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 [2019-01-02 00:11:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:11:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2019-01-02 00:11:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 569 transitions. Stem has 153 letters. Loop has 49 letters. [2019-01-02 00:11:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:11:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 569 transitions. Stem has 202 letters. Loop has 49 letters. [2019-01-02 00:11:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:11:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 569 transitions. Stem has 153 letters. Loop has 98 letters. [2019-01-02 00:11:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:11:26,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3870 states and 5266 transitions. [2019-01-02 00:11:26,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 556 [2019-01-02 00:11:26,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3870 states to 1750 states and 2352 transitions. [2019-01-02 00:11:26,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1107 [2019-01-02 00:11:26,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1107 [2019-01-02 00:11:26,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1750 states and 2352 transitions. [2019-01-02 00:11:26,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:11:26,675 INFO L705 BuchiCegarLoop]: Abstraction has 1750 states and 2352 transitions. [2019-01-02 00:11:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states and 2352 transitions. [2019-01-02 00:11:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2019-01-02 00:11:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-01-02 00:11:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2352 transitions. [2019-01-02 00:11:26,711 INFO L728 BuchiCegarLoop]: Abstraction has 1750 states and 2352 transitions. [2019-01-02 00:11:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:11:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:11:26,711 INFO L87 Difference]: Start difference. First operand 1750 states and 2352 transitions. Second operand 4 states. [2019-01-02 00:11:27,077 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-02 00:11:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:11:27,958 INFO L93 Difference]: Finished difference Result 2191 states and 2948 transitions. [2019-01-02 00:11:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:11:27,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2191 states and 2948 transitions. [2019-01-02 00:11:27,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 934 [2019-01-02 00:11:27,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2191 states to 2191 states and 2948 transitions. [2019-01-02 00:11:27,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1517 [2019-01-02 00:11:27,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1517 [2019-01-02 00:11:27,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2191 states and 2948 transitions. [2019-01-02 00:11:27,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:11:27,974 INFO L705 BuchiCegarLoop]: Abstraction has 2191 states and 2948 transitions. [2019-01-02 00:11:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states and 2948 transitions. [2019-01-02 00:11:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1750. [2019-01-02 00:11:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-01-02 00:11:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2352 transitions. [2019-01-02 00:11:28,006 INFO L728 BuchiCegarLoop]: Abstraction has 1750 states and 2352 transitions. [2019-01-02 00:11:28,006 INFO L608 BuchiCegarLoop]: Abstraction has 1750 states and 2352 transitions. [2019-01-02 00:11:28,006 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2019-01-02 00:11:28,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1750 states and 2352 transitions. [2019-01-02 00:11:28,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 556 [2019-01-02 00:11:28,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:11:28,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:11:28,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-01-02 00:11:28,019 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] [2019-01-02 00:11:28,023 INFO L794 eck$LassoCheckResult]: Stem: 108568#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 108302#L-1 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;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;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; 108303#L116-2 assume !!(add_history_type_~var~0 < 3); 108636#L117 assume 0 == add_history_type_~history_id;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; 108508#L171 assume 0 == read_history_bool_~history_id; 108509#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 108275#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 108494#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 108495#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; 108660#L116-2 assume !!(add_history_type_~var~0 < 3); 108661#L117 assume 0 == add_history_type_~history_id;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; 108771#L171 assume 0 == read_history_bool_~history_id; 108763#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 108758#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 108755#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 108751#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; 108750#L116-2 assume !!(add_history_type_~var~0 < 3); 108720#L117 assume 0 == add_history_type_~history_id;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; 108749#L171 assume 0 == read_history_bool_~history_id; 108735#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 108730#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 108727#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 108724#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; 108719#L116-2 assume !(add_history_type_~var~0 < 3); 108658#L116-3 add_history_type_#res := 1; 108531#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 108532#L255 assume !(0 == init_~tmp~1);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; 108626#L116-6 assume !!(add_history_type_~var~0 < 3); 108672#L117-2 assume !(0 == add_history_type_~history_id); 108716#L123-2 assume 1 == add_history_type_~history_id;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; 108659#L171-4 assume !(0 == read_history_bool_~history_id); 108580#L181-4 assume 1 == read_history_bool_~history_id; 108581#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 108482#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 108341#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 108342#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; 108673#L116-6 assume !!(add_history_type_~var~0 < 3); 108624#L117-2 assume !(0 == add_history_type_~history_id); 108625#L123-2 assume 1 == add_history_type_~history_id;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; 108791#L171-4 assume !(0 == read_history_bool_~history_id); 108788#L181-4 assume 1 == read_history_bool_~history_id; 108776#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 108774#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 108773#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 108768#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; 108767#L116-6 assume !!(add_history_type_~var~0 < 3); 108722#L117-2 assume !(0 == add_history_type_~history_id); 108760#L123-2 assume 1 == add_history_type_~history_id;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; 108757#L171-4 assume !(0 == read_history_bool_~history_id); 108754#L181-4 assume 1 == read_history_bool_~history_id; 108740#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 108731#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 108728#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 108725#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; 108721#L116-6 assume !(add_history_type_~var~0 < 3); 108669#L116-7 add_history_type_#res := 1; 108576#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 108523#L259 assume !(0 == init_~tmp___0~1);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; 108524#L116-10 assume !!(add_history_type_~var~0 < 3); 108620#L117-4 assume !(0 == add_history_type_~history_id); 108621#L123-4 assume !(1 == add_history_type_~history_id); 108715#L129-4 assume 2 == add_history_type_~history_id;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; 108671#L171-8 assume !(0 == read_history_bool_~history_id); 108588#L181-8 assume !(1 == read_history_bool_~history_id); 108357#L191-8 assume 2 == read_history_bool_~history_id; 108358#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 108499#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 108319#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 108320#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; 108668#L116-10 assume !!(add_history_type_~var~0 < 3); 108622#L117-4 assume !(0 == add_history_type_~history_id); 108623#L123-4 assume !(1 == add_history_type_~history_id); 108696#L129-4 assume 2 == add_history_type_~history_id;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; 108697#L171-8 assume !(0 == read_history_bool_~history_id); 108797#L181-8 assume !(1 == read_history_bool_~history_id); 108796#L191-8 assume 2 == read_history_bool_~history_id; 108792#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 108789#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 108787#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 108785#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; 108784#L116-10 assume !!(add_history_type_~var~0 < 3); 108779#L117-4 assume !(0 == add_history_type_~history_id); 108714#L123-4 assume !(1 == add_history_type_~history_id); 108695#L129-4 assume 2 == add_history_type_~history_id;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; 108670#L171-8 assume !(0 == read_history_bool_~history_id); 108587#L181-8 assume !(1 == read_history_bool_~history_id); 108354#L191-8 assume 2 == read_history_bool_~history_id; 108355#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 108497#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 108317#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 108318#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; 108680#L116-10 assume !(add_history_type_~var~0 < 3); 108655#L116-11 add_history_type_#res := 1; 108571#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 108286#L263 assume !(0 == init_~tmp___1~1);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; 108287#L116-14 assume !!(add_history_type_~var~0 < 3); 108610#L117-6 assume !(0 == add_history_type_~history_id); 108611#L123-6 assume !(1 == add_history_type_~history_id); 108687#L129-6 assume !(2 == add_history_type_~history_id); 108466#L135-9 assume 3 == add_history_type_~history_id;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; 108467#L151-3 assume 3 == read_history_int8_~history_id; 108486#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 108487#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 108490#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 108462#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; 108463#L116-14 assume !!(add_history_type_~var~0 < 3); 108612#L117-6 assume !(0 == add_history_type_~history_id); 108613#L123-6 assume !(1 == add_history_type_~history_id); 108766#L129-6 assume !(2 == add_history_type_~history_id); 108759#L135-9 assume 3 == add_history_type_~history_id;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; 108756#L151-3 assume 3 == read_history_int8_~history_id; 108747#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 108743#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 108732#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 108729#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; 108726#L116-14 assume !!(add_history_type_~var~0 < 3); 108723#L117-6 assume !(0 == add_history_type_~history_id); 108713#L123-6 assume !(1 == add_history_type_~history_id); 108686#L129-6 assume !(2 == add_history_type_~history_id); 108464#L135-9 assume 3 == add_history_type_~history_id;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; 108465#L151-3 assume 3 == read_history_int8_~history_id; 108483#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 108484#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 108489#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 108460#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; 108461#L116-14 assume !(add_history_type_~var~0 < 3); 108648#L116-15 add_history_type_#res := 1; 108569#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 108570#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 108527#L270 main_#t~ret57 := init_#res;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; 108528#L550-2 assume !!(main_~i2~0 < 10);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;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; 108798#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; 109155#L570-16 assume 0 != ~gate1Failed~0 % 256; 109153#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 109154#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; 109935#L409 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;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; 109934#L226-2 assume !(0 == write_history_bool_~history_id); 109932#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; 109930#L570-17 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; 109929#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 109928#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 109927#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 109926#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; 109925#L440 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;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; 109924#L226-4 assume !(0 == write_history_bool_~history_id); 109923#L231-4 assume !(1 == write_history_bool_~history_id); 109922#L236-4 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; 109919#L570-18 assume 0 != ~gate3Failed~0 % 256; 109920#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 108616#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; 108617#L471 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; 108677#L486 assume ~VALUE1~0 == ~VALUE2~0; 109738#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 109809#L570-19 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; 109804#L211 assume !(3 == write_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 109805#L575-40 [2019-01-02 00:11:28,023 INFO L796 eck$LassoCheckResult]: Loop: 109805#L575-40 assume !(0 == assert_~arg % 256); 109909#L570-20 ~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;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; 109908#L294 assume !(0 == ~gate1Failed~0 % 256); 109834#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 109833#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 109831#L171-12 assume 0 == read_history_bool_~history_id; 109829#L172-12 assume !(0 == read_history_bool_~historyIndex); 109826#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 109823#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 109822#L307 assume !(0 == check_~tmp___3~0 % 256); 108492#L307-1 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; 109945#L151-7 assume 3 == read_history_int8_~history_id; 109944#L152-7 assume !(0 == read_history_int8_~historyIndex); 109943#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 109541#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 109212#L346 assume !(check_~tmp___10~0 > -2); 108593#L346-1 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; 108594#L151-9 assume 3 == read_history_int8_~history_id; 108367#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 108368#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 108372#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 108478#L366-1 check_#res := 1; 108453#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 108454#L575-72 assume !(0 == assert_~arg % 256); 109174#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 109173#L550-2 assume !!(main_~i2~0 < 10);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;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; 109169#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; 109166#L570-16 assume 0 != ~gate1Failed~0 % 256; 109168#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 109907#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; 109906#L409 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;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; 109905#L226-2 assume !(0 == write_history_bool_~history_id); 109903#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; 109901#L570-17 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; 109899#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 109898#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 109894#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 109892#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; 109890#L440 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;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; 109888#L226-4 assume !(0 == write_history_bool_~history_id); 109886#L231-4 assume !(1 == write_history_bool_~history_id); 109884#L236-4 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; 109880#L570-18 assume 0 != ~gate3Failed~0 % 256; 109881#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 109938#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; 109936#L471 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; 108629#L486 assume ~VALUE1~0 == ~VALUE2~0; 108631#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 108702#L570-19 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; 109910#L211 assume !(3 == write_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 109805#L575-40 [2019-01-02 00:11:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1228733594, now seen corresponding path program 1 times [2019-01-02 00:11:28,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:11:28,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:11:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:11:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:11:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:11:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:11:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:11:28,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:11:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1699934906, now seen corresponding path program 1 times [2019-01-02 00:11:28,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:11:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:11:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:11:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:11:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:11:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:11:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:11:28,236 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:11:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:11:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:11:28,237 INFO L87 Difference]: Start difference. First operand 1750 states and 2352 transitions. cyclomatic complexity: 610 Second operand 3 states. [2019-01-02 00:11:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:11:28,259 INFO L93 Difference]: Finished difference Result 1754 states and 2332 transitions. [2019-01-02 00:11:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:11:28,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1754 states and 2332 transitions. [2019-01-02 00:11:28,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 544 [2019-01-02 00:11:28,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1754 states to 1754 states and 2332 transitions. [2019-01-02 00:11:28,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1103 [2019-01-02 00:11:28,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1103 [2019-01-02 00:11:28,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1754 states and 2332 transitions. [2019-01-02 00:11:28,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:11:28,281 INFO L705 BuchiCegarLoop]: Abstraction has 1754 states and 2332 transitions. [2019-01-02 00:11:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states and 2332 transitions. [2019-01-02 00:11:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1738. [2019-01-02 00:11:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-01-02 00:11:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2316 transitions. [2019-01-02 00:11:28,320 INFO L728 BuchiCegarLoop]: Abstraction has 1738 states and 2316 transitions. [2019-01-02 00:11:28,320 INFO L608 BuchiCegarLoop]: Abstraction has 1738 states and 2316 transitions. [2019-01-02 00:11:28,320 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2019-01-02 00:11:28,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1738 states and 2316 transitions. [2019-01-02 00:11:28,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 544 [2019-01-02 00:11:28,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:11:28,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:11:28,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:11:28,330 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] [2019-01-02 00:11:28,330 INFO L794 eck$LassoCheckResult]: Stem: 112088#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 111813#L-1 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;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;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; 111814#L116-2 assume !!(add_history_type_~var~0 < 3); 112165#L117 assume 0 == add_history_type_~history_id;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; 112027#L171 assume 0 == read_history_bool_~history_id; 112028#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 111786#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 112013#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 112014#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; 112194#L116-2 assume !!(add_history_type_~var~0 < 3); 112195#L117 assume 0 == add_history_type_~history_id;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; 112323#L171 assume 0 == read_history_bool_~history_id; 112308#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 112304#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 112302#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 112300#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; 112298#L116-2 assume !!(add_history_type_~var~0 < 3); 112260#L117 assume 0 == add_history_type_~history_id;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; 112290#L171 assume 0 == read_history_bool_~history_id; 112280#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 112271#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 112268#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 112265#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; 112259#L116-2 assume !(add_history_type_~var~0 < 3); 112192#L116-3 add_history_type_#res := 1; 112051#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 112052#L255 assume !(0 == init_~tmp~1);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; 112153#L116-6 assume !!(add_history_type_~var~0 < 3); 112151#L117-2 assume !(0 == add_history_type_~history_id); 112152#L123-2 assume 1 == add_history_type_~history_id;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; 112193#L171-4 assume !(0 == read_history_bool_~history_id); 112101#L181-4 assume 1 == read_history_bool_~history_id; 112102#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 112002#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 111850#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 111851#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; 112205#L116-6 assume !!(add_history_type_~var~0 < 3); 112206#L117-2 assume !(0 == add_history_type_~history_id); 112320#L123-2 assume 1 == add_history_type_~history_id;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; 112319#L171-4 assume !(0 == read_history_bool_~history_id); 112317#L181-4 assume 1 == read_history_bool_~history_id; 112313#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 112305#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 112303#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 112301#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; 112299#L116-6 assume !!(add_history_type_~var~0 < 3); 112262#L117-2 assume !(0 == add_history_type_~history_id); 112294#L123-2 assume 1 == add_history_type_~history_id;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; 112287#L171-4 assume !(0 == read_history_bool_~history_id); 112286#L181-4 assume 1 == read_history_bool_~history_id; 112275#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 112270#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 112267#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 112264#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; 112261#L116-6 assume !(add_history_type_~var~0 < 3); 112202#L116-7 add_history_type_#res := 1; 112096#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 112042#L259 assume !(0 == init_~tmp___0~1);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; 112043#L116-10 assume !!(add_history_type_~var~0 < 3); 112147#L117-4 assume !(0 == add_history_type_~history_id); 112148#L123-4 assume !(1 == add_history_type_~history_id); 113291#L129-4 assume 2 == add_history_type_~history_id;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; 113290#L171-8 assume !(0 == read_history_bool_~history_id); 113289#L181-8 assume !(1 == read_history_bool_~history_id); 113288#L191-8 assume 2 == read_history_bool_~history_id; 113284#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 113283#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 111830#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 111831#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; 112201#L116-10 assume !!(add_history_type_~var~0 < 3); 112149#L117-4 assume !(0 == add_history_type_~history_id); 112150#L123-4 assume !(1 == add_history_type_~history_id); 112234#L129-4 assume 2 == add_history_type_~history_id;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; 112204#L171-8 assume !(0 == read_history_bool_~history_id); 112108#L181-8 assume !(1 == read_history_bool_~history_id); 111870#L191-8 assume 2 == read_history_bool_~history_id; 111871#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 112018#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 112111#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 112217#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; 112218#L116-10 assume !!(add_history_type_~var~0 < 3); 112325#L117-4 assume !(0 == add_history_type_~history_id); 112256#L123-4 assume !(1 == add_history_type_~history_id); 112233#L129-4 assume 2 == add_history_type_~history_id;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; 112203#L171-8 assume !(0 == read_history_bool_~history_id); 112107#L181-8 assume !(1 == read_history_bool_~history_id); 111867#L191-8 assume 2 == read_history_bool_~history_id; 111868#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 112016#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 111828#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 111829#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; 112216#L116-10 assume !(add_history_type_~var~0 < 3); 112189#L116-11 add_history_type_#res := 1; 112091#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 111797#L263 assume !(0 == init_~tmp___1~1);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; 111798#L116-14 assume !!(add_history_type_~var~0 < 3); 112131#L117-6 assume !(0 == add_history_type_~history_id); 112132#L123-6 assume !(1 == add_history_type_~history_id); 112227#L129-6 assume !(2 == add_history_type_~history_id); 111986#L135-9 assume 3 == add_history_type_~history_id;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; 111987#L151-3 assume 3 == read_history_int8_~history_id; 112006#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 112007#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 112010#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 111982#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; 111983#L116-14 assume !!(add_history_type_~var~0 < 3); 112133#L117-6 assume !(0 == add_history_type_~history_id); 112134#L123-6 assume !(1 == add_history_type_~history_id); 112297#L129-6 assume !(2 == add_history_type_~history_id); 112296#L135-9 assume 3 == add_history_type_~history_id;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; 112295#L151-3 assume 3 == read_history_int8_~history_id; 112293#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 112283#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 112272#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 112269#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; 112266#L116-14 assume !!(add_history_type_~var~0 < 3); 112263#L117-6 assume !(0 == add_history_type_~history_id); 112255#L123-6 assume !(1 == add_history_type_~history_id); 112226#L129-6 assume !(2 == add_history_type_~history_id); 111984#L135-9 assume 3 == add_history_type_~history_id;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; 111985#L151-3 assume 3 == read_history_int8_~history_id; 112003#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 112004#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 112009#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 111980#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; 111981#L116-14 assume !(add_history_type_~var~0 < 3); 112175#L116-15 add_history_type_#res := 1; 112089#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 112090#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 112048#L270 main_#t~ret57 := init_#res;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; 112049#L550-2 assume !!(main_~i2~0 < 10);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;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; 112329#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; 112642#L570-16 assume 0 != ~gate1Failed~0 % 256; 112335#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 112044#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; 112045#L409 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;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; 112135#L226-2 assume !(0 == write_history_bool_~history_id); 112056#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; 111942#L570-17 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; 112212#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 111977#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 111978#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 113474#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; 113473#L440 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;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; 113472#L226-4 assume !(0 == write_history_bool_~history_id); 113471#L231-4 assume !(1 == write_history_bool_~history_id); 113470#L236-4 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; 111935#L570-18 assume 0 != ~gate3Failed~0 % 256; 111937#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 112161#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; 113337#L471 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; 113336#L486 assume ~VALUE1~0 == ~VALUE2~0; 113243#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 113108#L570-19 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; 113106#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; 113104#L570-20 ~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;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; 113103#L294 assume !(0 == ~gate1Failed~0 % 256); 113095#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 113092#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 113088#L171-12 assume 0 == read_history_bool_~history_id; 113082#L172-12 assume !(0 == read_history_bool_~historyIndex); 113065#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 113055#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 113047#L307 assume !(0 == check_~tmp___3~0 % 256); 112661#L307-1 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; 113037#L151-7 assume 3 == read_history_int8_~history_id; 113034#L152-7 assume !(0 == read_history_int8_~historyIndex); 113031#L155-7 assume !(1 == read_history_int8_~historyIndex);read_history_int8_#res := ~votedValue_History_2~0; 112475#L163-7 [2019-01-02 00:11:28,331 INFO L796 eck$LassoCheckResult]: Loop: 112475#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 112476#L346 assume !(check_~tmp___10~0 > -2); 112167#L346-1 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; 113282#L151-9 assume 3 == read_history_int8_~history_id; 113281#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 113280#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 112339#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 112126#L366-1 check_#res := 1; 112655#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 112654#L575-72 assume !(0 == assert_~arg % 256); 112653#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 112652#L550-2 assume !!(main_~i2~0 < 10);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;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; 112648#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; 112643#L570-16 assume 0 != ~gate1Failed~0 % 256; 112030#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 112031#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; 112947#L409 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;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; 112946#L226-2 assume !(0 == write_history_bool_~history_id); 112944#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; 112939#L570-17 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; 112937#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 112935#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 112933#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 112931#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; 112929#L440 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;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; 112927#L226-4 assume !(0 == write_history_bool_~history_id); 112925#L231-4 assume !(1 == write_history_bool_~history_id); 112923#L236-4 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; 112918#L570-18 assume 0 != ~gate3Failed~0 % 256; 112919#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 113022#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; 113018#L471 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; 113008#L486 assume ~VALUE1~0 == ~VALUE2~0; 113004#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 113001#L570-19 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; 112994#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; 112988#L570-20 ~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;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; 112984#L294 assume !(0 == ~gate1Failed~0 % 256); 112884#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 112883#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 112879#L171-12 assume 0 == read_history_bool_~history_id; 112877#L172-12 assume !(0 == read_history_bool_~historyIndex); 112876#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 112873#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 112872#L307 assume !(0 == check_~tmp___3~0 % 256); 112484#L307-1 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; 112485#L151-7 assume 3 == read_history_int8_~history_id; 112478#L152-7 assume !(0 == read_history_int8_~historyIndex); 112479#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 112475#L163-7 [2019-01-02 00:11:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 268006915, now seen corresponding path program 1 times [2019-01-02 00:11:28,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:11:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:11:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:11:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:11:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:11:28,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:11:28,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:11:28,456 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:11:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:11:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash -129222839, now seen corresponding path program 4 times [2019-01-02 00:11:28,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:11:28,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:11:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:11:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:11:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:11:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:11:29,829 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 254 DAG size of output: 221 [2019-01-02 00:11:32,616 WARN L181 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 181 DAG size of output: 162 [2019-01-02 00:11:32,620 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:11:32,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:11:32,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:11:32,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:11:32,621 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:11:32,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:32,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:11:32,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:11:32,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration29_Loop [2019-01-02 00:11:32,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:11:32,621 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:11:32,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:32,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,131 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-01-02 00:11:33,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:33,865 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-02 00:11:38,706 WARN L181 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2019-01-02 00:11:38,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:11:38,793 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:38,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:38,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:38,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:38,820 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:38,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:38,842 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 172 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:38,852 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:38,852 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:38,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:38,874 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 173 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:38,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:38,885 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:38,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:38,907 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 174 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:38,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:38,918 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:38,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:38,941 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 175 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:38,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:38,951 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:38,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:38,975 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 176 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:38,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:38,988 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,011 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 177 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,022 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,047 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 178 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,070 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,070 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,077 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 179 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,087 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,114 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 180 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,126 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,126 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,150 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 181 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,161 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,183 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 182 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,194 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,220 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 183 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,231 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,253 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 184 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,266 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,267 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Honda state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,289 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 185 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,300 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,324 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 186 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,336 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:39,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:39,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,374 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,399 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 188 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,409 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,409 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,433 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 189 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,445 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,445 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,469 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 190 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,480 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,480 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,506 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 191 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,516 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,542 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 192 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,552 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,576 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 193 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,585 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___10~0=0} Honda state: {ULTIMATE.start_check_~tmp___10~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,610 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 194 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,622 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,643 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 195 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,659 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,659 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,684 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 196 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,696 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,717 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 197 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,728 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,728 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:39,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:39,761 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,761 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:39,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,786 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:39,795 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,795 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,819 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 200 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,830 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:39,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,854 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 201 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:39,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,876 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=-128, ~gate1Failed_History_0~0=-128, ULTIMATE.start_check_~tmp___3~0=-128, ULTIMATE.start_read_history_bool_#res=-128, ~gate1Failed_History_1~0=-128, ~gate1Failed_History_2~0=-128} Honda state: {~gate1Failed~0=-128, ~gate1Failed_History_0~0=-128, ULTIMATE.start_check_~tmp___3~0=-128, ULTIMATE.start_read_history_bool_#res=-128, ~gate1Failed_History_1~0=-128, ~gate1Failed_History_2~0=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:39,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:39,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,909 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:39,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:39,942 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,942 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:39,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:39,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:39,979 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:39,979 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_27=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_27=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:40,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:40,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,032 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_27=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,040 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 206 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,051 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,051 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,075 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 207 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,099 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,099 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,124 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 208 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,134 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,159 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 209 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,172 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_27=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_27=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,196 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 210 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,208 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,232 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 211 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,243 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,243 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___11~0=0} Honda state: {ULTIMATE.start_check_~tmp___11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,267 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 212 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,279 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,301 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 [2019-01-02 00:11:40,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,312 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,337 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 214 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,350 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:40,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:40,396 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,396 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,421 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 216 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,444 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_27=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_27=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,453 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 217 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:40,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,464 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:40,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:11:40,500 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:11:40,503 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:11:40,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:11:40,536 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:11:40,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:11:40,868 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 220 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:53,135 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:11:53,149 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:11:53,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:11:53,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:11:53,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:11:53,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:11:53,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:11:53,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:11:53,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:11:53,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration29_Loop [2019-01-02 00:11:53,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:11:53,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:11:53,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,619 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-01-02 00:11:53,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:53,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:11:54,160 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-02 00:11:54,434 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-02 00:11:59,233 WARN L181 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2019-01-02 00:11:59,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:11:59,347 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:11:59,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:59,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:59,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:11:59,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:11:59,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,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 [2019-01-02 00:11:59,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:11:59,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:11:59,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:11:59,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:11:59,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:11:59,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:11:59,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:11:59,489 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2019-01-02 00:11:59,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:11:59,508 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-02 00:11:59,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:11:59,613 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:11:59,699 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:11:59,699 INFO L444 ModelExtractionUtils]: 16 out of 21 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:11:59,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:11:59,699 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:11:59,700 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:11:59,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~nomsg~0, ULTIMATE.start_read_history_int8_#res, ~g2v_old~0) = 1*~nomsg~0 - 1*ULTIMATE.start_read_history_int8_#res - 1*~g2v_old~0 Supporting invariants [] [2019-01-02 00:11:59,700 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:11:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:00,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:00,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:12:01,446 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 [2019-01-02 00:12:01,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1738 states and 2316 transitions. cyclomatic complexity: 586 Second operand 15 states. [2019-01-02 00:12:03,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1738 states and 2316 transitions. cyclomatic complexity: 586. Second operand 15 states. Result 8182 states and 10809 transitions. Complement of second has 41 states. [2019-01-02 00:12:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2019-01-02 00:12:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-02 00:12:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1174 transitions. [2019-01-02 00:12:03,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1174 transitions. Stem has 168 letters. Loop has 49 letters. [2019-01-02 00:12:03,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:12:03,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1174 transitions. Stem has 217 letters. Loop has 49 letters. [2019-01-02 00:12:03,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:12:03,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1174 transitions. Stem has 168 letters. Loop has 98 letters. [2019-01-02 00:12:03,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:12:03,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8182 states and 10809 transitions. [2019-01-02 00:12:03,226 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1088 [2019-01-02 00:12:03,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8182 states to 6302 states and 8345 transitions. [2019-01-02 00:12:03,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4060 [2019-01-02 00:12:03,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4482 [2019-01-02 00:12:03,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6302 states and 8345 transitions. [2019-01-02 00:12:03,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:03,243 INFO L705 BuchiCegarLoop]: Abstraction has 6302 states and 8345 transitions. [2019-01-02 00:12:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states and 8345 transitions. [2019-01-02 00:12:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 4385. [2019-01-02 00:12:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4385 states. [2019-01-02 00:12:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 5804 transitions. [2019-01-02 00:12:03,385 INFO L728 BuchiCegarLoop]: Abstraction has 4385 states and 5804 transitions. [2019-01-02 00:12:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:12:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:12:03,385 INFO L87 Difference]: Start difference. First operand 4385 states and 5804 transitions. Second operand 3 states. [2019-01-02 00:12:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:12:03,709 INFO L93 Difference]: Finished difference Result 2801 states and 3692 transitions. [2019-01-02 00:12:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:12:03,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2801 states and 3692 transitions. [2019-01-02 00:12:03,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1012 [2019-01-02 00:12:03,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2801 states to 2801 states and 3692 transitions. [2019-01-02 00:12:03,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1861 [2019-01-02 00:12:03,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1861 [2019-01-02 00:12:03,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2801 states and 3692 transitions. [2019-01-02 00:12:03,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:03,730 INFO L705 BuchiCegarLoop]: Abstraction has 2801 states and 3692 transitions. [2019-01-02 00:12:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states and 3692 transitions. [2019-01-02 00:12:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1738. [2019-01-02 00:12:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-01-02 00:12:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2312 transitions. [2019-01-02 00:12:03,755 INFO L728 BuchiCegarLoop]: Abstraction has 1738 states and 2312 transitions. [2019-01-02 00:12:03,755 INFO L608 BuchiCegarLoop]: Abstraction has 1738 states and 2312 transitions. [2019-01-02 00:12:03,755 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2019-01-02 00:12:03,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1738 states and 2312 transitions. [2019-01-02 00:12:03,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 544 [2019-01-02 00:12:03,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:12:03,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:12:03,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:12:03,762 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] [2019-01-02 00:12:03,763 INFO L794 eck$LassoCheckResult]: Stem: 129940#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 129669#L-1 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;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;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; 129670#L116-2 assume !!(add_history_type_~var~0 < 3); 130014#L117 assume 0 == add_history_type_~history_id;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; 129877#L171 assume 0 == read_history_bool_~history_id; 129878#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 129642#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 129863#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 129864#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; 130038#L116-2 assume !!(add_history_type_~var~0 < 3); 130039#L117 assume 0 == add_history_type_~history_id;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; 130152#L171 assume 0 == read_history_bool_~history_id; 130146#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 130142#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 130141#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 130139#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; 130137#L116-2 assume !!(add_history_type_~var~0 < 3); 130111#L117 assume 0 == add_history_type_~history_id;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; 130133#L171 assume 0 == read_history_bool_~history_id; 130122#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 130118#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 130116#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 130114#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; 130110#L116-2 assume !(add_history_type_~var~0 < 3); 130036#L116-3 add_history_type_#res := 1; 129902#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 129903#L255 assume !(0 == init_~tmp~1);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; 130005#L116-6 assume !!(add_history_type_~var~0 < 3); 130003#L117-2 assume !(0 == add_history_type_~history_id); 130004#L123-2 assume 1 == add_history_type_~history_id;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; 130037#L171-4 assume !(0 == read_history_bool_~history_id); 129954#L181-4 assume 1 == read_history_bool_~history_id; 129955#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 129858#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 129706#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 129707#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; 130050#L116-6 assume !!(add_history_type_~var~0 < 3); 130051#L117-2 assume !(0 == add_history_type_~history_id); 130165#L123-2 assume 1 == add_history_type_~history_id;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; 130164#L171-4 assume !(0 == read_history_bool_~history_id); 130163#L181-4 assume 1 == read_history_bool_~history_id; 130158#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 130155#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 130154#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 130149#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; 130143#L116-6 assume !!(add_history_type_~var~0 < 3); 130113#L117-2 assume !(0 == add_history_type_~history_id); 130140#L123-2 assume 1 == add_history_type_~history_id;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; 130138#L171-4 assume !(0 == read_history_bool_~history_id); 130136#L181-4 assume 1 == read_history_bool_~history_id; 130127#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 130119#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 130117#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 130115#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; 130112#L116-6 assume !(add_history_type_~var~0 < 3); 130047#L116-7 add_history_type_#res := 1; 129948#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 129891#L259 assume !(0 == init_~tmp___0~1);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; 129892#L116-10 assume !!(add_history_type_~var~0 < 3); 129999#L117-4 assume !(0 == add_history_type_~history_id); 130000#L123-4 assume !(1 == add_history_type_~history_id); 130077#L129-4 assume 2 == add_history_type_~history_id;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; 130078#L171-8 assume !(0 == read_history_bool_~history_id); 130183#L181-8 assume !(1 == read_history_bool_~history_id); 129723#L191-8 assume 2 == read_history_bool_~history_id; 129724#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 129868#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 129968#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 130172#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; 130046#L116-10 assume !!(add_history_type_~var~0 < 3); 130001#L117-4 assume !(0 == add_history_type_~history_id); 130002#L123-4 assume !(1 == add_history_type_~history_id); 130107#L129-4 assume 2 == add_history_type_~history_id;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; 130049#L171-8 assume !(0 == read_history_bool_~history_id); 129964#L181-8 assume !(1 == read_history_bool_~history_id); 129965#L191-8 assume 2 == read_history_bool_~history_id; 130177#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 130175#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 129685#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 129686#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; 130057#L116-10 assume !!(add_history_type_~var~0 < 3); 130166#L117-4 assume !(0 == add_history_type_~history_id); 130106#L123-4 assume !(1 == add_history_type_~history_id); 130076#L129-4 assume 2 == add_history_type_~history_id;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; 130048#L171-8 assume !(0 == read_history_bool_~history_id); 129963#L181-8 assume !(1 == read_history_bool_~history_id); 129720#L191-8 assume 2 == read_history_bool_~history_id; 129721#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 129866#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 129683#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 129684#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; 130056#L116-10 assume !(add_history_type_~var~0 < 3); 130033#L116-11 add_history_type_#res := 1; 129943#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 129653#L263 assume !(0 == init_~tmp___1~1);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; 129654#L116-14 assume !!(add_history_type_~var~0 < 3); 129988#L117-6 assume !(0 == add_history_type_~history_id); 129989#L123-6 assume !(1 == add_history_type_~history_id); 130207#L129-6 assume !(2 == add_history_type_~history_id); 130206#L135-9 assume 3 == add_history_type_~history_id;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; 130082#L151-3 assume 3 == read_history_int8_~history_id; 130083#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 130201#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 130200#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 129832#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; 129833#L116-14 assume !!(add_history_type_~var~0 < 3); 129990#L117-6 assume !(0 == add_history_type_~history_id); 129991#L123-6 assume !(1 == add_history_type_~history_id); 130065#L129-6 assume !(2 == add_history_type_~history_id); 129836#L135-9 assume 3 == add_history_type_~history_id;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; 129837#L151-3 assume 3 == read_history_int8_~history_id; 129852#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129853#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 129860#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 129953#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; 130194#L116-14 assume !!(add_history_type_~var~0 < 3); 130173#L117-6 assume !(0 == add_history_type_~history_id); 130105#L123-6 assume !(1 == add_history_type_~history_id); 130064#L129-6 assume !(2 == add_history_type_~history_id); 129834#L135-9 assume 3 == add_history_type_~history_id;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; 129835#L151-3 assume 3 == read_history_int8_~history_id; 129849#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129850#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 129859#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 129830#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; 129831#L116-14 assume !(add_history_type_~var~0 < 3); 130024#L116-15 add_history_type_#res := 1; 129941#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 129942#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 129893#L270 main_#t~ret57 := init_#res;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; 129894#L550-2 assume !!(main_~i2~0 < 10);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;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; 130264#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; 130509#L570-16 assume 0 != ~gate1Failed~0 % 256; 130452#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 129895#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; 129896#L409 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;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; 129873#L226-2 assume !(0 == write_history_bool_~history_id); 129874#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; 129786#L570-17 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; 129787#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 129828#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 129702#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 129703#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; 129712#L440 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;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; 129951#L226-4 assume !(0 == write_history_bool_~history_id); 129944#L231-4 assume !(1 == write_history_bool_~history_id); 129945#L236-4 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; 129790#L570-18 assume 0 != ~gate3Failed~0 % 256; 129792#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 129995#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; 129996#L471 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; 130054#L486 assume ~VALUE1~0 == ~VALUE2~0; 131328#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 131326#L570-19 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; 131324#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; 131322#L570-20 ~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;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; 131320#L294 assume !(0 == ~gate1Failed~0 % 256); 131294#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 131291#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 130043#L171-12 assume 0 == read_history_bool_~history_id; 130006#L172-12 assume !(0 == read_history_bool_~historyIndex); 129984#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 129817#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 129960#L307 assume !(0 == check_~tmp___3~0 % 256); 130567#L307-1 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; 130566#L151-7 assume 3 == read_history_int8_~history_id; 130565#L152-7 assume !(0 == read_history_int8_~historyIndex); 130564#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 130563#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 130562#L346 assume check_~tmp___10~0 > -2;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; 130059#L151-8 [2019-01-02 00:12:03,763 INFO L796 eck$LassoCheckResult]: Loop: 130059#L151-8 assume 3 == read_history_int8_~history_id; 130060#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 130592#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 130569#L348 assume check_~tmp___6~0 == ~nomsg~0;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; 130027#L171-15 assume 0 == read_history_bool_~history_id; 130028#L172-15 assume !(0 == read_history_bool_~historyIndex); 129982#L175-15 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 129719#L203-15 check_#t~ret20 := read_history_bool_#res;check_~tmp___7~0 := check_#t~ret20;havoc check_#t~ret20; 129914#L350 assume !(0 != check_~tmp___7~0 % 256);check_#res := 0; 130517#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 129975#L575-72 assume !(0 == assert_~arg % 256); 129708#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 129709#L550-2 assume !!(main_~i2~0 < 10);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;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; 129883#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; 129844#L570-16 assume 0 != ~gate1Failed~0 % 256; 131024#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 131016#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; 131013#L409 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;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; 131010#L226-2 assume !(0 == write_history_bool_~history_id); 131005#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; 130998#L570-17 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; 130975#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 130971#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 130969#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 130966#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; 130964#L440 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;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; 130958#L226-4 assume !(0 == write_history_bool_~history_id); 130954#L231-4 assume !(1 == write_history_bool_~history_id); 130941#L236-4 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; 130933#L570-18 assume 0 != ~gate3Failed~0 % 256; 130929#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 130925#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; 130921#L471 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; 130915#L486 assume ~VALUE1~0 == ~VALUE2~0; 130911#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 130906#L570-19 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; 130901#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; 130897#L570-20 ~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;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; 130896#L294 assume !(0 == ~gate1Failed~0 % 256); 130780#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 130777#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 130773#L171-12 assume 0 == read_history_bool_~history_id; 130763#L172-12 assume !(0 == read_history_bool_~historyIndex); 130758#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 130753#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 130746#L307 assume !(0 == check_~tmp___3~0 % 256); 130524#L307-1 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; 130589#L151-7 assume 3 == read_history_int8_~history_id; 130588#L152-7 assume !(0 == read_history_int8_~historyIndex); 130587#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 130586#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 130585#L346 assume check_~tmp___10~0 > -2;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; 130059#L151-8 [2019-01-02 00:12:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash -143341660, now seen corresponding path program 1 times [2019-01-02 00:12:03,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:03,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:03,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:12:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:12:03,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:12:03,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:12:04,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:04,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-02 00:12:04,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:12:04,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-02 00:12:04,205 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:12:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:04,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1233573482, now seen corresponding path program 1 times [2019-01-02 00:12:04,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:04,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:04,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:04,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:04,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:12:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:12:04,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:12:04,360 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:12:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:12:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:12:04,360 INFO L87 Difference]: Start difference. First operand 1738 states and 2312 transitions. cyclomatic complexity: 582 Second operand 4 states. [2019-01-02 00:12:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:12:04,428 INFO L93 Difference]: Finished difference Result 1691 states and 2160 transitions. [2019-01-02 00:12:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:12:04,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1691 states and 2160 transitions. [2019-01-02 00:12:04,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 494 [2019-01-02 00:12:04,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1691 states to 1584 states and 2039 transitions. [2019-01-02 00:12:04,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1000 [2019-01-02 00:12:04,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1000 [2019-01-02 00:12:04,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1584 states and 2039 transitions. [2019-01-02 00:12:04,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:04,446 INFO L705 BuchiCegarLoop]: Abstraction has 1584 states and 2039 transitions. [2019-01-02 00:12:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states and 2039 transitions. [2019-01-02 00:12:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2019-01-02 00:12:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2019-01-02 00:12:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2039 transitions. [2019-01-02 00:12:04,459 INFO L728 BuchiCegarLoop]: Abstraction has 1584 states and 2039 transitions. [2019-01-02 00:12:04,459 INFO L608 BuchiCegarLoop]: Abstraction has 1584 states and 2039 transitions. [2019-01-02 00:12:04,459 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2019-01-02 00:12:04,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1584 states and 2039 transitions. [2019-01-02 00:12:04,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 494 [2019-01-02 00:12:04,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:12:04,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:12:04,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:12:04,465 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] [2019-01-02 00:12:04,470 INFO L794 eck$LassoCheckResult]: Stem: 133864#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 133613#L-1 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;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;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; 133614#L116-2 assume !!(add_history_type_~var~0 < 3); 133969#L117 assume 0 == add_history_type_~history_id;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; 134123#L171 assume 0 == read_history_bool_~history_id; 134116#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 134111#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 134108#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 134105#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; 133970#L116-2 assume !!(add_history_type_~var~0 < 3); 133942#L117 assume 0 == add_history_type_~history_id;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; 133790#L171 assume 0 == read_history_bool_~history_id; 133791#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 133594#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 133780#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 133781#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; 134085#L116-2 assume !!(add_history_type_~var~0 < 3); 134084#L117 assume 0 == add_history_type_~history_id;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; 134094#L171 assume 0 == read_history_bool_~history_id; 134090#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 134087#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 134086#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 133989#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; 133990#L116-2 assume !(add_history_type_~var~0 < 3); 133967#L116-3 add_history_type_#res := 1; 133815#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 133816#L255 assume !(0 == init_~tmp~1);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; 133933#L116-6 assume !!(add_history_type_~var~0 < 3); 133931#L117-2 assume !(0 == add_history_type_~history_id); 133932#L123-2 assume 1 == add_history_type_~history_id;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; 133968#L171-4 assume !(0 == read_history_bool_~history_id); 133879#L181-4 assume 1 == read_history_bool_~history_id; 133880#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 133767#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 133643#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 133644#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; 133987#L116-6 assume !!(add_history_type_~var~0 < 3); 133988#L117-2 assume !(0 == add_history_type_~history_id); 134104#L123-2 assume 1 == add_history_type_~history_id;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; 134103#L171-4 assume !(0 == read_history_bool_~history_id); 134101#L181-4 assume 1 == read_history_bool_~history_id; 134098#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 134093#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 134092#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 133995#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; 133996#L116-6 assume !!(add_history_type_~var~0 < 3); 134048#L117-2 assume !(0 == add_history_type_~history_id); 134075#L123-2 assume 1 == add_history_type_~history_id;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; 134072#L171-4 assume !(0 == read_history_bool_~history_id); 134067#L181-4 assume 1 == read_history_bool_~history_id; 134062#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 134057#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 134054#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 134051#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; 134047#L116-6 assume !(add_history_type_~var~0 < 3); 133984#L116-7 add_history_type_#res := 1; 133872#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 133801#L259 assume !(0 == init_~tmp___0~1);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; 133802#L116-10 assume !!(add_history_type_~var~0 < 3); 133925#L117-4 assume !(0 == add_history_type_~history_id); 133926#L123-4 assume !(1 == add_history_type_~history_id); 134017#L129-4 assume 2 == add_history_type_~history_id;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; 133986#L171-8 assume !(0 == read_history_bool_~history_id); 133888#L181-8 assume !(1 == read_history_bool_~history_id); 133659#L191-8 assume 2 == read_history_bool_~history_id; 133660#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 133891#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 133627#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 133628#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; 133983#L116-10 assume !!(add_history_type_~var~0 < 3); 133927#L117-4 assume !(0 == add_history_type_~history_id); 133928#L123-4 assume !(1 == add_history_type_~history_id); 134046#L129-4 assume 2 == add_history_type_~history_id;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; 134078#L171-8 assume !(0 == read_history_bool_~history_id); 134076#L181-8 assume !(1 == read_history_bool_~history_id); 134074#L191-8 assume 2 == read_history_bool_~history_id; 134070#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 134065#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 134059#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 134056#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; 134053#L116-10 assume !!(add_history_type_~var~0 < 3); 134050#L117-4 assume !(0 == add_history_type_~history_id); 134045#L123-4 assume !(1 == add_history_type_~history_id); 134016#L129-4 assume 2 == add_history_type_~history_id;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; 133985#L171-8 assume !(0 == read_history_bool_~history_id); 133887#L181-8 assume !(1 == read_history_bool_~history_id); 133657#L191-8 assume 2 == read_history_bool_~history_id; 133658#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 133889#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 133625#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 133626#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; 133982#L116-10 assume !(add_history_type_~var~0 < 3); 133960#L116-11 add_history_type_#res := 1; 133867#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 133603#L263 assume !(0 == init_~tmp___1~1);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; 133604#L116-14 assume !!(add_history_type_~var~0 < 3); 133913#L117-6 assume !(0 == add_history_type_~history_id); 133914#L123-6 assume !(1 == add_history_type_~history_id); 134077#L129-6 assume !(2 == add_history_type_~history_id); 133754#L135-9 assume 3 == add_history_type_~history_id;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; 133755#L151-3 assume 3 == read_history_int8_~history_id; 133771#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133772#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 133777#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 133750#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; 133751#L116-14 assume !!(add_history_type_~var~0 < 3); 133915#L117-6 assume !(0 == add_history_type_~history_id); 133916#L123-6 assume !(1 == add_history_type_~history_id); 134002#L129-6 assume !(2 == add_history_type_~history_id); 134003#L135-9 assume 3 == add_history_type_~history_id;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; 134073#L151-3 assume 3 == read_history_int8_~history_id; 134069#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 134064#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 134058#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 134055#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; 134052#L116-14 assume !!(add_history_type_~var~0 < 3); 134049#L117-6 assume !(0 == add_history_type_~history_id); 134044#L123-6 assume !(1 == add_history_type_~history_id); 134001#L129-6 assume !(2 == add_history_type_~history_id); 133752#L135-9 assume 3 == add_history_type_~history_id;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; 133753#L151-3 assume 3 == read_history_int8_~history_id; 133768#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133769#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 133776#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 133748#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; 133749#L116-14 assume !(add_history_type_~var~0 < 3); 133952#L116-15 add_history_type_#res := 1; 133865#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 133866#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 133807#L270 main_#t~ret57 := init_#res;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; 133808#L550-2 assume !!(main_~i2~0 < 10);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;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; 134405#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; 134500#L570-16 assume 0 != ~gate1Failed~0 % 256; 134497#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 133809#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; 133810#L409 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;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; 133786#L226-2 assume !(0 == write_history_bool_~history_id); 133787#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; 133706#L570-17 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; 133707#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 133746#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 133645#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 133646#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; 133653#L440 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;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; 133877#L226-4 assume !(0 == write_history_bool_~history_id); 133868#L231-4 assume !(1 == write_history_bool_~history_id); 133869#L236-4 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; 133710#L570-18 assume 0 != ~gate3Failed~0 % 256; 133712#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 133921#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; 133922#L471 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; 134772#L486 assume ~VALUE1~0 == ~VALUE2~0; 134769#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 134767#L570-19 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; 134765#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; 134763#L570-20 ~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;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; 134761#L294 assume !(0 == ~gate1Failed~0 % 256); 134755#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 134752#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 134749#L171-12 assume 0 == read_history_bool_~history_id; 134750#L172-12 assume !(0 == read_history_bool_~historyIndex); 134720#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 134715#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 134559#L307 assume !(0 == check_~tmp___3~0 % 256); 133620#L307-1 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; 133629#L151-7 assume 3 == read_history_int8_~history_id; 133674#L152-7 assume !(0 == read_history_int8_~historyIndex); 133675#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 133678#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 133679#L346 assume check_~tmp___10~0 > -2;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; 133912#L151-8 [2019-01-02 00:12:04,470 INFO L796 eck$LassoCheckResult]: Loop: 133912#L151-8 assume 3 == read_history_int8_~history_id; 134626#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133672#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 133673#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 133930#L346-1 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; 134181#L151-9 assume 3 == read_history_int8_~history_id; 134182#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 134566#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 134565#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 134004#L366-1 check_#res := 1; 133741#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 133742#L575-72 assume !(0 == assert_~arg % 256); 134549#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 133874#L550-2 assume !!(main_~i2~0 < 10);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;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; 133797#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; 133756#L570-16 assume 0 != ~gate1Failed~0 % 256; 133758#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 134964#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; 134962#L409 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;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; 134960#L226-2 assume !(0 == write_history_bool_~history_id); 134956#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; 134955#L570-17 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; 134952#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 134950#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 134948#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 134946#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; 134944#L440 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;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; 134942#L226-4 assume !(0 == write_history_bool_~history_id); 134940#L231-4 assume !(1 == write_history_bool_~history_id); 134938#L236-4 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; 134935#L570-18 assume 0 != ~gate3Failed~0 % 256; 134936#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 135064#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; 135063#L471 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; 135061#L486 assume ~VALUE1~0 == ~VALUE2~0; 134028#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 134029#L570-19 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; 135169#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; 135168#L570-20 ~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;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; 134035#L294 assume !(0 == ~gate1Failed~0 % 256); 134036#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 135121#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 133978#L171-12 assume 0 == read_history_bool_~history_id; 133934#L172-12 assume !(0 == read_history_bool_~historyIndex); 133907#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 133884#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 133885#L307 assume !(0 == check_~tmp___3~0 % 256); 134584#L307-1 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; 134583#L151-7 assume 3 == read_history_int8_~history_id; 134582#L152-7 assume !(0 == read_history_int8_~historyIndex); 134581#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 134580#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 134187#L346 assume check_~tmp___10~0 > -2;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; 133912#L151-8 [2019-01-02 00:12:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -143341660, now seen corresponding path program 2 times [2019-01-02 00:12:04,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:04,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:12:04,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:12:04,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:12:04,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:12:04,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:12:04,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:12:04,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-02 00:12:04,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:12:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-02 00:12:04,938 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:12:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1363633193, now seen corresponding path program 1 times [2019-01-02 00:12:04,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:04,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:04,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:12:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:12:05,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:12:05,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-02 00:12:05,006 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:12:05,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:12:05,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:12:05,006 INFO L87 Difference]: Start difference. First operand 1584 states and 2039 transitions. cyclomatic complexity: 463 Second operand 7 states. [2019-01-02 00:12:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:12:05,579 INFO L93 Difference]: Finished difference Result 4874 states and 6167 transitions. [2019-01-02 00:12:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-02 00:12:05,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4874 states and 6167 transitions. [2019-01-02 00:12:05,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2480 [2019-01-02 00:12:05,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4874 states to 4874 states and 6167 transitions. [2019-01-02 00:12:05,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3643 [2019-01-02 00:12:05,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3643 [2019-01-02 00:12:05,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4874 states and 6167 transitions. [2019-01-02 00:12:05,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:05,613 INFO L705 BuchiCegarLoop]: Abstraction has 4874 states and 6167 transitions. [2019-01-02 00:12:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states and 6167 transitions. [2019-01-02 00:12:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 1588. [2019-01-02 00:12:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-01-02 00:12:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2045 transitions. [2019-01-02 00:12:05,640 INFO L728 BuchiCegarLoop]: Abstraction has 1588 states and 2045 transitions. [2019-01-02 00:12:05,640 INFO L608 BuchiCegarLoop]: Abstraction has 1588 states and 2045 transitions. [2019-01-02 00:12:05,640 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2019-01-02 00:12:05,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1588 states and 2045 transitions. [2019-01-02 00:12:05,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 508 [2019-01-02 00:12:05,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:12:05,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:12:05,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:12:05,646 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] [2019-01-02 00:12:05,646 INFO L794 eck$LassoCheckResult]: Stem: 140870#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 140616#L-1 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;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;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; 140617#L116-2 assume !!(add_history_type_~var~0 < 3); 140979#L117 assume 0 == add_history_type_~history_id;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; 141284#L171 assume 0 == read_history_bool_~history_id; 141270#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 141218#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 141213#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 141203#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; 141204#L116-2 assume !!(add_history_type_~var~0 < 3); 141286#L117 assume 0 == add_history_type_~history_id;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; 141277#L171 assume 0 == read_history_bool_~history_id; 141278#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 141289#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 141288#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 141287#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; 140980#L116-2 assume !!(add_history_type_~var~0 < 3); 140950#L117 assume 0 == add_history_type_~history_id;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; 140794#L171 assume 0 == read_history_bool_~history_id; 140795#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 140597#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 140784#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 140785#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; 141000#L116-2 assume !(add_history_type_~var~0 < 3); 140976#L116-3 add_history_type_#res := 1; 140820#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 140821#L255 assume !(0 == init_~tmp~1);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; 140938#L116-6 assume !!(add_history_type_~var~0 < 3); 140998#L117-2 assume !(0 == add_history_type_~history_id); 141305#L123-2 assume 1 == add_history_type_~history_id;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; 141304#L171-4 assume !(0 == read_history_bool_~history_id); 140883#L181-4 assume 1 == read_history_bool_~history_id; 140884#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 140887#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 140651#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 140652#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; 140999#L116-6 assume !!(add_history_type_~var~0 < 3); 140936#L117-2 assume !(0 == add_history_type_~history_id); 140937#L123-2 assume 1 == add_history_type_~history_id;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; 140977#L171-4 assume !(0 == read_history_bool_~history_id); 140978#L181-4 assume 1 == read_history_bool_~history_id; 140981#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 140771#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 141300#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 141006#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; 141007#L116-6 assume !!(add_history_type_~var~0 < 3); 141081#L117-2 assume !(0 == add_history_type_~history_id); 141107#L123-2 assume 1 == add_history_type_~history_id;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; 141104#L171-4 assume !(0 == read_history_bool_~history_id); 141100#L181-4 assume 1 == read_history_bool_~history_id; 141095#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 141088#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 141084#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 141083#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; 141080#L116-6 assume !(add_history_type_~var~0 < 3); 140995#L116-7 add_history_type_#res := 1; 140878#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 140805#L259 assume !(0 == init_~tmp___0~1);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; 140806#L116-10 assume !!(add_history_type_~var~0 < 3); 140930#L117-4 assume !(0 == add_history_type_~history_id); 140931#L123-4 assume !(1 == add_history_type_~history_id); 141036#L129-4 assume 2 == add_history_type_~history_id;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; 141037#L171-8 assume !(0 == read_history_bool_~history_id); 141108#L181-8 assume !(1 == read_history_bool_~history_id); 141106#L191-8 assume 2 == read_history_bool_~history_id; 141102#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 141098#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 141092#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 141087#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; 140994#L116-10 assume !!(add_history_type_~var~0 < 3); 140932#L117-4 assume !(0 == add_history_type_~history_id); 140933#L123-4 assume !(1 == add_history_type_~history_id); 141079#L129-4 assume 2 == add_history_type_~history_id;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; 140997#L171-8 assume !(0 == read_history_bool_~history_id); 140893#L181-8 assume !(1 == read_history_bool_~history_id); 140663#L191-8 assume 2 == read_history_bool_~history_id; 140664#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 140896#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 140632#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 140633#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; 141005#L116-10 assume !!(add_history_type_~var~0 < 3); 141082#L117-4 assume !(0 == add_history_type_~history_id); 141078#L123-4 assume !(1 == add_history_type_~history_id); 141035#L129-4 assume 2 == add_history_type_~history_id;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; 140996#L171-8 assume !(0 == read_history_bool_~history_id); 140892#L181-8 assume !(1 == read_history_bool_~history_id); 140661#L191-8 assume 2 == read_history_bool_~history_id; 140662#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 140894#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 140630#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 140631#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; 140993#L116-10 assume !(add_history_type_~var~0 < 3); 140973#L116-11 add_history_type_#res := 1; 140873#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 140606#L263 assume !(0 == init_~tmp___1~1);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; 140607#L116-14 assume !!(add_history_type_~var~0 < 3); 140920#L117-6 assume !(0 == add_history_type_~history_id); 140921#L123-6 assume !(1 == add_history_type_~history_id); 141018#L129-6 assume !(2 == add_history_type_~history_id); 140758#L135-9 assume 3 == add_history_type_~history_id;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; 140759#L151-3 assume 3 == read_history_int8_~history_id; 140775#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 140776#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 140781#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 140754#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; 140755#L116-14 assume !!(add_history_type_~var~0 < 3); 140922#L117-6 assume !(0 == add_history_type_~history_id); 140923#L123-6 assume !(1 == add_history_type_~history_id); 141077#L129-6 assume !(2 == add_history_type_~history_id); 141327#L135-9 assume 3 == add_history_type_~history_id;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; 141043#L151-3 assume 3 == read_history_int8_~history_id; 141044#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 141324#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 141322#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 141320#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; 141318#L116-14 assume !!(add_history_type_~var~0 < 3); 141316#L117-6 assume !(0 == add_history_type_~history_id); 141076#L123-6 assume !(1 == add_history_type_~history_id); 141017#L129-6 assume !(2 == add_history_type_~history_id); 140756#L135-9 assume 3 == add_history_type_~history_id;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; 140757#L151-3 assume 3 == read_history_int8_~history_id; 140772#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 140773#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 140780#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 140752#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; 140753#L116-14 assume !(add_history_type_~var~0 < 3); 140962#L116-15 add_history_type_#res := 1; 140871#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 140872#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 140811#L270 main_#t~ret57 := init_#res;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; 140812#L550-2 assume !!(main_~i2~0 < 10);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;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; 141330#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; 141502#L570-16 assume 0 != ~gate1Failed~0 % 256; 141501#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 140813#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; 140814#L409 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;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; 140790#L226-2 assume !(0 == write_history_bool_~history_id); 140791#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; 140711#L570-17 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; 140712#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 140750#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 140647#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 140648#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; 140657#L440 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;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; 140881#L226-4 assume !(0 == write_history_bool_~history_id); 140874#L231-4 assume !(1 == write_history_bool_~history_id); 140875#L236-4 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; 140715#L570-18 assume 0 != ~gate3Failed~0 % 256; 140717#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 140926#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; 140927#L471 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; 140942#L486 assume ~VALUE1~0 == ~VALUE2~0; 140943#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 141054#L570-19 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; 141660#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; 141530#L570-20 ~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;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; 141531#L294 assume !(0 == ~gate1Failed~0 % 256); 141637#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 141632#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 141628#L171-12 assume 0 == read_history_bool_~history_id; 141623#L172-12 assume !(0 == read_history_bool_~historyIndex); 141619#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 141615#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 141588#L307 assume !(0 == check_~tmp___3~0 % 256); 141584#L307-1 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; 141014#L151-7 assume 3 == read_history_int8_~history_id; 141015#L152-7 assume !(0 == read_history_int8_~historyIndex); 140948#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 140949#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 140917#L346 assume check_~tmp___10~0 > -2;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; 140918#L151-8 [2019-01-02 00:12:05,647 INFO L796 eck$LassoCheckResult]: Loop: 140918#L151-8 assume 3 == read_history_int8_~history_id; 140674#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 140675#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 141572#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 140919#L346-1 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; 141569#L151-9 assume 3 == read_history_int8_~history_id; 141566#L152-9 assume !(0 == read_history_int8_~historyIndex); 140667#L155-9 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 140666#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 141563#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 140769#L366-1 check_#res := 1; 141019#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 141560#L575-72 assume !(0 == assert_~arg % 256); 141559#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 141558#L550-2 assume !!(main_~i2~0 < 10);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;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; 141555#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; 140760#L570-16 assume 0 != ~gate1Failed~0 % 256; 140762#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 140797#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; 142138#L409 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;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; 142135#L226-2 assume !(0 == write_history_bool_~history_id); 142131#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; 142129#L570-17 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; 142127#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 142125#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 142123#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 142121#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; 142119#L440 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;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; 142117#L226-4 assume !(0 == write_history_bool_~history_id); 142114#L231-4 assume !(1 == write_history_bool_~history_id); 142112#L236-4 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; 142109#L570-18 assume 0 != ~gate3Failed~0 % 256; 142107#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 142104#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; 142102#L471 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; 142100#L486 assume ~VALUE1~0 == ~VALUE2~0; 142101#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 142164#L570-19 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; 141532#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; 141533#L570-20 ~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;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; 141529#L294 assume !(0 == ~gate1Failed~0 % 256); 141516#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 141515#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 141512#L171-12 assume 0 == read_history_bool_~history_id; 141514#L172-12 assume !(0 == read_history_bool_~historyIndex); 141986#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 141985#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 140622#L307 assume !(0 == check_~tmp___3~0 % 256); 140623#L307-1 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; 140628#L151-7 assume 3 == read_history_int8_~history_id; 140679#L152-7 assume !(0 == read_history_int8_~historyIndex); 140680#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 140683#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 140684#L346 assume check_~tmp___10~0 > -2;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; 140918#L151-8 [2019-01-02 00:12:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash -143341660, now seen corresponding path program 3 times [2019-01-02 00:12:05,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:05,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:12:05,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:12:05,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:12:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:12:06,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-02 00:12:06,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:12:06,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-01-02 00:12:06,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:12:06,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-02 00:12:06,168 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:12:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1965687265, now seen corresponding path program 1 times [2019-01-02 00:12:06,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:06,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:12:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:12:06,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:12:06,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:12:06,211 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:12:06,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:12:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:12:06,212 INFO L87 Difference]: Start difference. First operand 1588 states and 2045 transitions. cyclomatic complexity: 465 Second operand 3 states. [2019-01-02 00:12:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:12:06,267 INFO L93 Difference]: Finished difference Result 1539 states and 1894 transitions. [2019-01-02 00:12:06,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:12:06,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1539 states and 1894 transitions. [2019-01-02 00:12:06,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 484 [2019-01-02 00:12:06,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1539 states to 1539 states and 1894 transitions. [2019-01-02 00:12:06,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 969 [2019-01-02 00:12:06,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 969 [2019-01-02 00:12:06,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1539 states and 1894 transitions. [2019-01-02 00:12:06,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:06,279 INFO L705 BuchiCegarLoop]: Abstraction has 1539 states and 1894 transitions. [2019-01-02 00:12:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states and 1894 transitions. [2019-01-02 00:12:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1535. [2019-01-02 00:12:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2019-01-02 00:12:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1890 transitions. [2019-01-02 00:12:06,293 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1890 transitions. [2019-01-02 00:12:06,293 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1890 transitions. [2019-01-02 00:12:06,293 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2019-01-02 00:12:06,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1890 transitions. [2019-01-02 00:12:06,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 482 [2019-01-02 00:12:06,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:12:06,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:12:06,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:12:06,298 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] [2019-01-02 00:12:06,299 INFO L794 eck$LassoCheckResult]: Stem: 144499#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 144266#L-1 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;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;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; 144267#L116-2 assume !!(add_history_type_~var~0 < 3); 144604#L117 assume 0 == add_history_type_~history_id;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; 144764#L171 assume 0 == read_history_bool_~history_id; 144759#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 144754#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 144752#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 144619#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; 144605#L116-2 assume !!(add_history_type_~var~0 < 3); 144582#L117 assume 0 == add_history_type_~history_id;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; 144432#L171 assume 0 == read_history_bool_~history_id; 144433#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 144247#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 144422#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 144423#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; 144732#L116-2 assume !!(add_history_type_~var~0 < 3); 144704#L117 assume 0 == add_history_type_~history_id;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; 144728#L171 assume 0 == read_history_bool_~history_id; 144724#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 144719#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 144716#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 144713#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; 144703#L116-2 assume !(add_history_type_~var~0 < 3); 144602#L116-3 add_history_type_#res := 1; 144457#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 144458#L255 assume !(0 == init_~tmp~1);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; 144570#L116-6 assume !!(add_history_type_~var~0 < 3); 144568#L117-2 assume !(0 == add_history_type_~history_id); 144569#L123-2 assume 1 == add_history_type_~history_id;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; 144674#L171-4 assume !(0 == read_history_bool_~history_id); 145025#L181-4 assume 1 == read_history_bool_~history_id; 144606#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 144411#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 144301#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 144302#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; 144617#L116-6 assume !!(add_history_type_~var~0 < 3); 144618#L117-2 assume !(0 == add_history_type_~history_id); 145026#L123-2 assume 1 == add_history_type_~history_id;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; 144603#L171-4 assume !(0 == read_history_bool_~history_id); 144513#L181-4 assume 1 == read_history_bool_~history_id; 144514#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 145021#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145020#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 144709#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; 144710#L116-6 assume !!(add_history_type_~var~0 < 3); 144705#L117-2 assume !(0 == add_history_type_~history_id); 145019#L123-2 assume 1 == add_history_type_~history_id;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; 144946#L171-4 assume !(0 == read_history_bool_~history_id); 144945#L181-4 assume 1 == read_history_bool_~history_id; 144936#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 144932#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 144930#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 144624#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; 144625#L116-6 assume !(add_history_type_~var~0 < 3); 144614#L116-7 add_history_type_#res := 1; 144507#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 144449#L259 assume !(0 == init_~tmp___0~1);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; 144450#L116-10 assume !!(add_history_type_~var~0 < 3); 144564#L117-4 assume !(0 == add_history_type_~history_id); 144565#L123-4 assume !(1 == add_history_type_~history_id); 144644#L129-4 assume 2 == add_history_type_~history_id;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; 144616#L171-8 assume !(0 == read_history_bool_~history_id); 144525#L181-8 assume !(1 == read_history_bool_~history_id); 144313#L191-8 assume 2 == read_history_bool_~history_id; 144314#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 144528#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 144283#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 144284#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; 144613#L116-10 assume !!(add_history_type_~var~0 < 3); 144566#L117-4 assume !(0 == add_history_type_~history_id); 144567#L123-4 assume !(1 == add_history_type_~history_id); 144698#L129-4 assume 2 == add_history_type_~history_id;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; 144696#L171-8 assume !(0 == read_history_bool_~history_id); 144693#L181-8 assume !(1 == read_history_bool_~history_id); 144691#L191-8 assume 2 == read_history_bool_~history_id; 144687#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 144685#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 144684#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 144680#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; 144678#L116-10 assume !!(add_history_type_~var~0 < 3); 144677#L117-4 assume !(0 == add_history_type_~history_id); 144673#L123-4 assume !(1 == add_history_type_~history_id); 144643#L129-4 assume 2 == add_history_type_~history_id;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; 144615#L171-8 assume !(0 == read_history_bool_~history_id); 144524#L181-8 assume !(1 == read_history_bool_~history_id); 144311#L191-8 assume 2 == read_history_bool_~history_id; 144312#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 144526#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 144281#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 144282#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; 144612#L116-10 assume !(add_history_type_~var~0 < 3); 144599#L116-11 add_history_type_#res := 1; 144502#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 144256#L263 assume !(0 == init_~tmp___1~1);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; 144257#L116-14 assume !!(add_history_type_~var~0 < 3); 144550#L117-6 assume !(0 == add_history_type_~history_id); 144551#L123-6 assume !(1 == add_history_type_~history_id); 144635#L129-6 assume !(2 == add_history_type_~history_id); 144399#L135-9 assume 3 == add_history_type_~history_id;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; 144400#L151-3 assume 3 == read_history_int8_~history_id; 144720#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 144717#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 144714#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 144395#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; 144396#L116-14 assume !!(add_history_type_~var~0 < 3); 144552#L117-6 assume !(0 == add_history_type_~history_id); 144553#L123-6 assume !(1 == add_history_type_~history_id); 144672#L129-6 assume !(2 == add_history_type_~history_id); 144730#L135-9 assume 3 == add_history_type_~history_id;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; 144648#L151-3 assume 3 == read_history_int8_~history_id; 144414#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 144415#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 144419#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 144512#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; 144676#L116-14 assume !!(add_history_type_~var~0 < 3); 144675#L117-6 assume !(0 == add_history_type_~history_id); 144671#L123-6 assume !(1 == add_history_type_~history_id); 144634#L129-6 assume !(2 == add_history_type_~history_id); 144397#L135-9 assume 3 == add_history_type_~history_id;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; 144398#L151-3 assume 3 == read_history_int8_~history_id; 144412#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 144413#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 144418#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 144393#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; 144394#L116-14 assume !(add_history_type_~var~0 < 3); 144593#L116-15 add_history_type_#res := 1; 144500#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 144501#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 144454#L270 main_#t~ret57 := init_#res;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; 144455#L550-2 assume !!(main_~i2~0 < 10);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;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; 144925#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; 145037#L570-16 assume 0 != ~gate1Failed~0 % 256; 144926#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 144927#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; 145362#L409 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;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; 145358#L226-2 assume !(0 == write_history_bool_~history_id); 145262#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; 145263#L570-17 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; 145256#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 145257#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 145248#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 145249#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; 145241#L440 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;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; 145242#L226-4 assume !(0 == write_history_bool_~history_id); 145234#L231-4 assume !(1 == write_history_bool_~history_id); 145235#L236-4 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; 145227#L570-18 assume 0 != ~gate3Failed~0 % 256; 145229#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 145285#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; 145286#L471 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; 145277#L486 assume ~VALUE1~0 == ~VALUE2~0; 145276#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 145275#L570-19 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; 145274#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; 145273#L570-20 ~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;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; 145272#L294 assume !(0 == ~gate1Failed~0 % 256); 145187#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 145188#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 145181#L171-12 assume 0 == read_history_bool_~history_id; 145180#L172-12 assume !(0 == read_history_bool_~historyIndex); 145178#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 145175#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 145176#L307 assume !(0 == check_~tmp___3~0 % 256); 144278#L307-1 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; 144279#L151-7 assume 3 == read_history_int8_~history_id; 144326#L152-7 assume !(0 == read_history_int8_~historyIndex); 144327#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 145076#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 145077#L346 assume check_~tmp___10~0 > -2;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; 144626#L151-8 [2019-01-02 00:12:06,299 INFO L796 eck$LassoCheckResult]: Loop: 144626#L151-8 assume 3 == read_history_int8_~history_id; 144627#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 144324#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 144325#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 145507#L346-1 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; 144656#L151-9 assume 3 == read_history_int8_~history_id; 144657#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 144319#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 144320#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 144654#L151-10 assume 3 == read_history_int8_~history_id; 144655#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 144389#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 144390#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 144636#L366-1 check_#res := 1; 144637#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 145734#L575-72 assume !(0 == assert_~arg % 256); 145733#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 145732#L550-2 assume !!(main_~i2~0 < 10);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;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; 145039#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; 145040#L570-16 assume 0 != ~gate1Failed~0 % 256; 144435#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 144436#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; 144451#L409 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;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; 145464#L226-2 assume !(0 == write_history_bool_~history_id); 145453#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; 145452#L570-17 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; 145451#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 145449#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 145447#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 145445#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; 145443#L440 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;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; 145441#L226-4 assume !(0 == write_history_bool_~history_id); 145440#L231-4 assume !(1 == write_history_bool_~history_id); 145437#L236-4 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; 145434#L570-18 assume 0 != ~gate3Failed~0 % 256; 145435#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 145680#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; 145679#L471 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; 145676#L486 assume ~VALUE1~0 == ~VALUE2~0; 145674#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 145671#L570-19 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; 145669#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; 145668#L570-20 ~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;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; 145667#L294 assume !(0 == ~gate1Failed~0 % 256); 145250#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 145247#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 145243#L171-12 assume 0 == read_history_bool_~history_id; 145240#L172-12 assume !(0 == read_history_bool_~historyIndex); 145237#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 145233#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 145230#L307 assume !(0 == check_~tmp___3~0 % 256); 144273#L307-1 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; 145529#L151-7 assume 3 == read_history_int8_~history_id; 145527#L152-7 assume !(0 == read_history_int8_~historyIndex); 144580#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 144581#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 145509#L346 assume check_~tmp___10~0 > -2;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; 144626#L151-8 [2019-01-02 00:12:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -143341660, now seen corresponding path program 4 times [2019-01-02 00:12:06,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:06,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:06,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:06,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:12:07,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:12:07,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:12:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-02 00:12:07,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-02 00:12:07,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:12:07,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-02 00:12:07,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:12:07,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-02 00:12:07,849 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:12:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1155251345, now seen corresponding path program 1 times [2019-01-02 00:12:07,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:07,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:07,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:12:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:12:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:12:09,558 WARN L181 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 287 DAG size of output: 250 [2019-01-02 00:12:12,476 WARN L181 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 187 DAG size of output: 168 [2019-01-02 00:12:12,482 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:12:12,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:12:12,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:12:12,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:12:12,482 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:12:12,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:12,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:12:12,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:12:12,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration33_Loop [2019-01-02 00:12:12,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:12:12,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:12:12,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:12,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,032 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-02 00:12:13,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:13,424 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-02 00:12:13,867 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-01-02 00:12:13,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:12:21,195 WARN L181 SmtUtils]: Spent 7.07 s on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2019-01-02 00:12:21,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:12:21,240 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,249 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 225 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,261 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,261 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,283 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 226 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,296 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Honda state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,318 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 227 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,330 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,354 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 228 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,365 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,387 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 229 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,398 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,398 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,425 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 230 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,437 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,459 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 231 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,471 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,471 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,496 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 232 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,507 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,507 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,532 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 233 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,543 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,566 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 234 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,591 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,598 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 235 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,609 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,609 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,637 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 236 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,647 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,647 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,671 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 237 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,723 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,723 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id=3, ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_~history_id=3, ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,748 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 238 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,760 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,781 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 239 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,793 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,815 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 240 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,825 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,825 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,848 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 241 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,858 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,883 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 242 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,896 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,920 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 243 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,935 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,935 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,959 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 244 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:21,970 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:21,970 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:21,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:21,994 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 245 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,004 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,030 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 246 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,033 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,060 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 247 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,073 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,096 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 248 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,122 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=128, ~gate1Failed_History_0~0=128, ULTIMATE.start_check_~tmp___3~0=128, ULTIMATE.start_read_history_bool_#res=128, ~gate1Failed_History_1~0=128, ~gate1Failed_History_2~0=128} Honda state: {~gate1Failed~0=128, ~gate1Failed_History_0~0=128, ULTIMATE.start_check_~tmp___3~0=128, ULTIMATE.start_read_history_bool_#res=128, ~gate1Failed_History_1~0=128, ~gate1Failed_History_2~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,146 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 249 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,157 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,157 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,179 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 250 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,188 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,188 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,211 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 251 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,220 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,220 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,246 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 252 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,257 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,282 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 253 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:22,293 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:22,320 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 254 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:22,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:12:22,355 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 255 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,510 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:12:22,511 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:12:22,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:12:22,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:12:22,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:12:22,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:12:22,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:22,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:12:22,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:12:22,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration33_Loop [2019-01-02 00:12:22,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:12:22,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:12:22,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12:22,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12:22,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:22,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,156 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-02 00:12:23,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:23,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12:23,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12:23,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12: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 [2019-01-02 00:12:23,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12: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 [2019-01-02 00:12:23,550 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-02 00:12:23,955 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-01-02 00:12:23,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:12:31,263 WARN L181 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2019-01-02 00:12:31,306 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:12:31,306 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:12:31,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:12:31,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:12:31,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:12:31,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:12:31,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:12:31,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:12:31,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:12:31,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:12:31,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:12:31,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:12:31,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:12:31,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:12:31,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:12:31,376 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:12:31,377 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:12:31,377 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:12:31,377 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:12:31,377 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:12:31,377 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:12:31,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:12:31,377 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:12:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:31,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:31,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:12:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:12:32,222 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 [2019-01-02 00:12:32,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1535 states and 1890 transitions. cyclomatic complexity: 363 Second operand 5 states. [2019-01-02 00:12:32,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1535 states and 1890 transitions. cyclomatic complexity: 363. Second operand 5 states. Result 3323 states and 4088 transitions. Complement of second has 6 states. [2019-01-02 00:12:32,537 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 [2019-01-02 00:12:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:12:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2019-01-02 00:12:32,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 405 transitions. Stem has 170 letters. Loop has 57 letters. [2019-01-02 00:12:32,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:12:32,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 405 transitions. Stem has 227 letters. Loop has 57 letters. [2019-01-02 00:12:32,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:12:32,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 405 transitions. Stem has 170 letters. Loop has 114 letters. [2019-01-02 00:12:32,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:12:32,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3323 states and 4088 transitions. [2019-01-02 00:12:32,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 414 [2019-01-02 00:12:32,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3323 states to 1477 states and 1822 transitions. [2019-01-02 00:12:32,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 907 [2019-01-02 00:12:32,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 907 [2019-01-02 00:12:32,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1477 states and 1822 transitions. [2019-01-02 00:12:32,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:32,555 INFO L705 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2019-01-02 00:12:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states and 1822 transitions. [2019-01-02 00:12:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1477. [2019-01-02 00:12:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-01-02 00:12:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1822 transitions. [2019-01-02 00:12:32,568 INFO L728 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2019-01-02 00:12:32,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-02 00:12:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-02 00:12:32,568 INFO L87 Difference]: Start difference. First operand 1477 states and 1822 transitions. Second operand 12 states. [2019-01-02 00:12:33,200 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-02 00:12:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:12:33,499 INFO L93 Difference]: Finished difference Result 2254 states and 2761 transitions. [2019-01-02 00:12:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-02 00:12:33,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2254 states and 2761 transitions. [2019-01-02 00:12:33,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2019-01-02 00:12:33,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2254 states to 2254 states and 2761 transitions. [2019-01-02 00:12:33,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1388 [2019-01-02 00:12:33,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1388 [2019-01-02 00:12:33,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2254 states and 2761 transitions. [2019-01-02 00:12:33,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:12:33,518 INFO L705 BuchiCegarLoop]: Abstraction has 2254 states and 2761 transitions. [2019-01-02 00:12:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states and 2761 transitions. [2019-01-02 00:12:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1477. [2019-01-02 00:12:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-01-02 00:12:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1822 transitions. [2019-01-02 00:12:33,534 INFO L728 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2019-01-02 00:12:33,534 INFO L608 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2019-01-02 00:12:33,534 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2019-01-02 00:12:33,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1477 states and 1822 transitions. [2019-01-02 00:12:33,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 414 [2019-01-02 00:12:33,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:12:33,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:12:33,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:12:33,539 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] [2019-01-02 00:12:33,552 INFO L794 eck$LassoCheckResult]: Stem: 154426#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 154115#L-1 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;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;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; 154116#L116-2 assume !!(add_history_type_~var~0 < 3); 154174#L117 assume 0 == add_history_type_~history_id;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; 154175#L171 assume 0 == read_history_bool_~history_id; 154352#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 154540#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 154323#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 154324#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; 154284#L116-2 assume !!(add_history_type_~var~0 < 3); 154285#L117 assume 0 == add_history_type_~history_id;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; 154545#L171 assume 0 == read_history_bool_~history_id; 154179#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 154078#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 154487#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 154333#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; 154334#L116-2 assume !!(add_history_type_~var~0 < 3); 154525#L117 assume 0 == add_history_type_~history_id;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; 154538#L171 assume 0 == read_history_bool_~history_id; 154535#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 154531#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 154530#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 154529#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; 154524#L116-2 assume !(add_history_type_~var~0 < 3); 154278#L116-3 add_history_type_#res := 1; 154279#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 154117#L255 assume !(0 == init_~tmp~1);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; 154118#L116-6 assume !!(add_history_type_~var~0 < 3); 154109#L117-2 assume !(0 == add_history_type_~history_id); 154110#L123-2 assume 1 == add_history_type_~history_id;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; 154282#L171-4 assume !(0 == read_history_bool_~history_id); 154283#L181-4 assume 1 == read_history_bool_~history_id; 154527#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 154451#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 154452#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 154523#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; 154331#L116-6 assume !!(add_history_type_~var~0 < 3); 154332#L117-2 assume !(0 == add_history_type_~history_id); 154490#L123-2 assume 1 == add_history_type_~history_id;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; 154491#L171-4 assume !(0 == read_history_bool_~history_id); 154447#L181-4 assume 1 == read_history_bool_~history_id; 154286#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 154287#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 154157#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 154158#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; 154358#L116-6 assume !!(add_history_type_~var~0 < 3); 154494#L117-2 assume !(0 == add_history_type_~history_id); 154519#L123-2 assume 1 == add_history_type_~history_id;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; 154516#L171-4 assume !(0 == read_history_bool_~history_id); 154512#L181-4 assume 1 == read_history_bool_~history_id; 154507#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 154502#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 154499#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 154497#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; 154493#L116-6 assume !(add_history_type_~var~0 < 3); 154325#L116-7 add_history_type_#res := 1; 154326#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 154365#L259 assume !(0 == init_~tmp___0~1);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; 154366#L116-10 assume !!(add_history_type_~var~0 < 3); 154095#L117-4 assume !(0 == add_history_type_~history_id); 154096#L123-4 assume !(1 == add_history_type_~history_id); 154522#L129-4 assume 2 == add_history_type_~history_id;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; 154329#L171-8 assume !(0 == read_history_bool_~history_id); 154330#L181-8 assume !(1 == read_history_bool_~history_id); 154518#L191-8 assume 2 == read_history_bool_~history_id; 154514#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 154510#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 154504#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 154501#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; 154314#L116-10 assume !!(add_history_type_~var~0 < 3); 154097#L117-4 assume !(0 == add_history_type_~history_id); 154098#L123-4 assume !(1 == add_history_type_~history_id); 154400#L129-4 assume 2 == add_history_type_~history_id;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; 154401#L171-8 assume !(0 == read_history_bool_~history_id); 154466#L181-8 assume !(1 == read_history_bool_~history_id); 154182#L191-8 assume 2 == read_history_bool_~history_id; 154183#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 154383#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 154135#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 154136#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; 154348#L116-10 assume !!(add_history_type_~var~0 < 3); 154496#L117-4 assume !(0 == add_history_type_~history_id); 154488#L123-4 assume !(1 == add_history_type_~history_id); 154399#L129-4 assume 2 == add_history_type_~history_id;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; 154327#L171-8 assume !(0 == read_history_bool_~history_id); 154328#L181-8 assume !(1 == read_history_bool_~history_id); 154180#L191-8 assume 2 == read_history_bool_~history_id; 154181#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 154381#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 154133#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 154134#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; 154313#L116-10 assume !(add_history_type_~var~0 < 3); 154224#L116-11 add_history_type_#res := 1; 154225#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 154103#L263 assume !(0 == init_~tmp___1~1);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; 154104#L116-14 assume !!(add_history_type_~var~0 < 3); 154079#L117-6 assume !(0 == add_history_type_~history_id); 154080#L123-6 assume !(1 == add_history_type_~history_id); 154385#L129-6 assume !(2 == add_history_type_~history_id); 154291#L135-9 assume 3 == add_history_type_~history_id;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; 154292#L151-3 assume 3 == read_history_int8_~history_id; 154317#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154318#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 154320#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 154281#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; 154199#L116-14 assume !!(add_history_type_~var~0 < 3); 154081#L117-6 assume !(0 == add_history_type_~history_id); 154082#L123-6 assume !(1 == add_history_type_~history_id); 154521#L129-6 assume !(2 == add_history_type_~history_id); 154520#L135-9 assume 3 == add_history_type_~history_id;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; 154517#L151-3 assume 3 == read_history_int8_~history_id; 154513#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154509#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 154503#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 154500#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; 154498#L116-14 assume !!(add_history_type_~var~0 < 3); 154495#L117-6 assume !(0 == add_history_type_~history_id); 154486#L123-6 assume !(1 == add_history_type_~history_id); 154384#L129-6 assume !(2 == add_history_type_~history_id); 154289#L135-9 assume 3 == add_history_type_~history_id;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; 154290#L151-3 assume 3 == read_history_int8_~history_id; 154315#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154316#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 154319#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 154280#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; 154198#L116-14 assume !(add_history_type_~var~0 < 3); 154196#L116-15 add_history_type_#res := 1; 154197#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 154427#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 154369#L270 main_#t~ret57 := init_#res;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; 154370#L550-2 assume !!(main_~i2~0 < 10);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;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; 154609#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; 154931#L570-16 assume 0 != ~gate1Failed~0 % 256; 154610#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 154371#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; 154372#L409 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;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; 155189#L226-2 assume !(0 == write_history_bool_~history_id); 155190#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; 154238#L570-17 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; 154239#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 154271#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 154272#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 154167#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; 154168#L440 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;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; 154293#L226-4 assume !(0 == write_history_bool_~history_id); 154294#L231-4 assume !(1 == write_history_bool_~history_id); 154454#L236-4 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; 154455#L570-18 assume 0 != ~gate3Failed~0 % 256; 154150#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 154151#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; 155410#L471 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; 155409#L486 assume ~VALUE1~0 == ~VALUE2~0; 154897#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 155408#L570-19 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; 155407#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; 155405#L570-20 ~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;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; 155403#L294 assume !(0 == ~gate1Failed~0 % 256); 155391#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 155390#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 155388#L171-12 assume 0 == read_history_bool_~history_id; 155389#L172-12 assume !(0 == read_history_bool_~historyIndex); 155384#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 155377#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 155264#L307 assume !(0 == check_~tmp___3~0 % 256); 154137#L307-1 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; 154138#L151-7 assume 3 == read_history_int8_~history_id; 154200#L152-7 assume !(0 == read_history_int8_~historyIndex); 154170#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 154171#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 154202#L346 assume !(check_~tmp___10~0 > -2); 155097#L346-1 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; 155095#L151-9 assume 3 == read_history_int8_~history_id; 155093#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 155092#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 154377#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 154378#L151-10 [2019-01-02 00:12:33,552 INFO L796 eck$LassoCheckResult]: Loop: 154378#L151-10 assume 3 == read_history_int8_~history_id; 154263#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154264#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 154992#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 154386#L366-1 check_#res := 1; 154265#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 154266#L575-72 assume !(0 == assert_~arg % 256); 154770#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 154619#L550-2 assume !!(main_~i2~0 < 10);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;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; 154620#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; 154300#L570-16 assume 0 != ~gate1Failed~0 % 256; 154302#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 154904#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; 154899#L409 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;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; 154895#L226-2 assume !(0 == write_history_bool_~history_id); 154889#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; 154887#L570-17 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; 154885#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 154881#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 154878#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 154875#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; 154873#L440 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;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; 154870#L226-4 assume !(0 == write_history_bool_~history_id); 154867#L231-4 assume !(1 == write_history_bool_~history_id); 154857#L236-4 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; 154851#L570-18 assume 0 != ~gate3Failed~0 % 256; 154852#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 154882#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; 154879#L471 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; 154876#L486 assume ~VALUE1~0 == ~VALUE2~0; 154877#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 154973#L570-19 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; 154968#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; 154967#L570-20 ~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;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; 154965#L294 assume !(0 == ~gate1Failed~0 % 256); 154966#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 155045#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 155044#L171-12 assume 0 == read_history_bool_~history_id; 155043#L172-12 assume !(0 == read_history_bool_~historyIndex); 155042#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 154736#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 154737#L307 assume !(0 == check_~tmp___3~0 % 256); 154994#L307-1 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; 154639#L151-7 assume 3 == read_history_int8_~history_id; 154640#L152-7 assume !(0 == read_history_int8_~historyIndex); 154635#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 154636#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 154631#L346 assume !(check_~tmp___10~0 > -2); 154632#L346-1 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; 154627#L151-9 assume 3 == read_history_int8_~history_id; 154628#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154623#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 154624#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 154378#L151-10 [2019-01-02 00:12:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 493734230, now seen corresponding path program 1 times [2019-01-02 00:12:33,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:33,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:33,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:33,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:33,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:12:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:12:33,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:12:33,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-02 00:12:33,794 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:12:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:12:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash 777847101, now seen corresponding path program 1 times [2019-01-02 00:12:33,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:12:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:12:33,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:33,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:12:33,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:12:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:12:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:12:35,239 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 272 DAG size of output: 239 [2019-01-02 00:12:38,191 WARN L181 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 190 DAG size of output: 171 [2019-01-02 00:12:38,196 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:12:38,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:12:38,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:12:38,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:12:38,197 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:12:38,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:38,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:12:38,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:12:38,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration34_Loop [2019-01-02 00:12:38,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:12:38,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:12:38,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,549 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-02 00:12:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:38,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:12:39,173 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-02 00:12:39,477 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-02 00:12:39,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:12:49,352 WARN L181 SmtUtils]: Spent 9.55 s on a formula simplification. DAG size of input: 189 DAG size of output: 141 [2019-01-02 00:12:49,528 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:12:49,528 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,553 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:12:49,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,564 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,591 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 257 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,604 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=0, ~gate2Failed_History_1~0=0, ~gate2Failed_History_0~0=0, ~gate2Failed_History_2~0=0} Honda state: {~gate2Failed~0=0, ~gate2Failed_History_1~0=0, ~gate2Failed_History_0~0=0, ~gate2Failed_History_2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,629 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 258 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,641 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,641 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,665 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 259 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,680 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,702 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 260 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=-128, ~gate1Failed_History_0~0=-128, ULTIMATE.start_check_~tmp___3~0=-128, ULTIMATE.start_read_history_bool_#res=-128, ~gate1Failed_History_1~0=-128, ~gate1Failed_History_2~0=-128} Honda state: {~gate1Failed~0=-128, ~gate1Failed_History_0~0=-128, ULTIMATE.start_check_~tmp___3~0=-128, ULTIMATE.start_read_history_bool_#res=-128, ~gate1Failed_History_1~0=-128, ~gate1Failed_History_2~0=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,747 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 261 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,782 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 262 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,793 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,820 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 263 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,832 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,858 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 264 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,870 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:49,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,894 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 265 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:12:49,907 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:12:49,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:12:49,959 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:12:50,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:12:50,590 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 267 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:03,049 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:13:03,067 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:13:03,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:13:03,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:13:03,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:13:03,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:13:03,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:03,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:13:03,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:13:03,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration34_Loop [2019-01-02 00:13:03,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:13:03,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:13:03,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,790 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-02 00:13:03,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:03,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:04,064 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-02 00:13:04,559 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-02 00:13:04,588 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:13:14,511 WARN L181 SmtUtils]: Spent 9.69 s on a formula simplification. DAG size of input: 189 DAG size of output: 141 [2019-01-02 00:13:14,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:13:14,546 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:13:14,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:13:14,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:13:14,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:13:14,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:13:14,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:13:14,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:13:14,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:13:14,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:13:14,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:13:14,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:13:14,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:13:14,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:13:14,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:13:14,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:13:14,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:13:14,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:13:14,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:13:14,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:13:14,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:13:14,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:13:14,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:13:14,604 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:13:14,605 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:13:14,605 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:13:14,605 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:13:14,605 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:13:14,606 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:13:14,606 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:13:14,606 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:13:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:13:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:13:15,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:13:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:13:15,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:13:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:13:15,544 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 [2019-01-02 00:13:15,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1477 states and 1822 transitions. cyclomatic complexity: 353 Second operand 5 states. [2019-01-02 00:13:15,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1477 states and 1822 transitions. cyclomatic complexity: 353. Second operand 5 states. Result 3173 states and 3912 transitions. Complement of second has 6 states. [2019-01-02 00:13:15,770 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 [2019-01-02 00:13:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:13:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2019-01-02 00:13:15,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 357 transitions. Stem has 175 letters. Loop has 53 letters. [2019-01-02 00:13:15,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:13:15,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 357 transitions. Stem has 228 letters. Loop has 53 letters. [2019-01-02 00:13:15,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:13:15,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 357 transitions. Stem has 175 letters. Loop has 106 letters. [2019-01-02 00:13:15,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:13:15,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3173 states and 3912 transitions. [2019-01-02 00:13:15,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2019-01-02 00:13:15,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3173 states to 1128 states and 1389 transitions. [2019-01-02 00:13:15,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 558 [2019-01-02 00:13:15,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2019-01-02 00:13:15,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1389 transitions. [2019-01-02 00:13:15,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:13:15,788 INFO L705 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2019-01-02 00:13:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1389 transitions. [2019-01-02 00:13:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2019-01-02 00:13:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-01-02 00:13:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1389 transitions. [2019-01-02 00:13:15,797 INFO L728 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2019-01-02 00:13:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-02 00:13:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-02 00:13:15,797 INFO L87 Difference]: Start difference. First operand 1128 states and 1389 transitions. Second operand 9 states. [2019-01-02 00:13:16,705 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-02 00:13:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:13:17,400 INFO L93 Difference]: Finished difference Result 1769 states and 2160 transitions. [2019-01-02 00:13:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-02 00:13:17,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1769 states and 2160 transitions. [2019-01-02 00:13:17,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2019-01-02 00:13:17,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1769 states to 1769 states and 2160 transitions. [2019-01-02 00:13:17,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 763 [2019-01-02 00:13:17,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 763 [2019-01-02 00:13:17,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1769 states and 2160 transitions. [2019-01-02 00:13:17,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:13:17,417 INFO L705 BuchiCegarLoop]: Abstraction has 1769 states and 2160 transitions. [2019-01-02 00:13:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states and 2160 transitions. [2019-01-02 00:13:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1128. [2019-01-02 00:13:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-01-02 00:13:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1389 transitions. [2019-01-02 00:13:17,429 INFO L728 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2019-01-02 00:13:17,429 INFO L608 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2019-01-02 00:13:17,429 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2019-01-02 00:13:17,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1128 states and 1389 transitions. [2019-01-02 00:13:17,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2019-01-02 00:13:17,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:13:17,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:13:17,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 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, 1, 1, 1, 1] [2019-01-02 00:13:17,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] [2019-01-02 00:13:17,441 INFO L794 eck$LassoCheckResult]: Stem: 162683#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 162399#L-1 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;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;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; 162400#L116-2 assume !!(add_history_type_~var~0 < 3); 162555#L117 assume 0 == add_history_type_~history_id;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; 162785#L171 assume 0 == read_history_bool_~history_id; 162783#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 162781#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 162780#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 162604#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; 162556#L116-2 assume !!(add_history_type_~var~0 < 3); 162456#L117 assume 0 == add_history_type_~history_id;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; 162457#L171 assume 0 == read_history_bool_~history_id; 162458#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 162362#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 162594#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 162595#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; 162779#L116-2 assume !!(add_history_type_~var~0 < 3); 162763#L117 assume 0 == add_history_type_~history_id;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; 162777#L171 assume 0 == read_history_bool_~history_id; 162774#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 162727#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 162728#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 162769#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; 162762#L116-2 assume !(add_history_type_~var~0 < 3); 162548#L116-3 add_history_type_#res := 1; 162549#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 162401#L255 assume !(0 == init_~tmp~1);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; 162402#L116-6 assume !!(add_history_type_~var~0 < 3); 162602#L117-2 assume !(0 == add_history_type_~history_id); 162730#L123-2 assume 1 == add_history_type_~history_id;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; 162731#L171-4 assume !(0 == read_history_bool_~history_id); 162698#L181-4 assume 1 == read_history_bool_~history_id; 162699#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 162702#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 162439#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 162440#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; 162603#L116-6 assume !!(add_history_type_~var~0 < 3); 162393#L117-2 assume !(0 == add_history_type_~history_id); 162394#L123-2 assume 1 == add_history_type_~history_id;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; 162553#L171-4 assume !(0 == read_history_bool_~history_id); 162554#L181-4 assume 1 == read_history_bool_~history_id; 162557#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 162558#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 162768#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 162767#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; 162766#L116-6 assume !!(add_history_type_~var~0 < 3); 162735#L117-2 assume !(0 == add_history_type_~history_id); 162760#L123-2 assume 1 == add_history_type_~history_id;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; 162757#L171-4 assume !(0 == read_history_bool_~history_id); 162753#L181-4 assume 1 == read_history_bool_~history_id; 162748#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 162743#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 162740#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 162738#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; 162734#L116-6 assume !(add_history_type_~var~0 < 3); 162596#L116-7 add_history_type_#res := 1; 162597#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 162625#L259 assume !(0 == init_~tmp___0~1);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; 162626#L116-10 assume !!(add_history_type_~var~0 < 3); 162379#L117-4 assume !(0 == add_history_type_~history_id); 162380#L123-4 assume !(1 == add_history_type_~history_id); 162765#L129-4 assume 2 == add_history_type_~history_id;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; 162764#L171-8 assume !(0 == read_history_bool_~history_id); 162713#L181-8 assume !(1 == read_history_bool_~history_id); 162461#L191-8 assume 2 == read_history_bool_~history_id; 162462#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 162646#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 162419#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 162420#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; 162585#L116-10 assume !!(add_history_type_~var~0 < 3); 162381#L117-4 assume !(0 == add_history_type_~history_id); 162382#L123-4 assume !(1 == add_history_type_~history_id); 162668#L129-4 assume 2 == add_history_type_~history_id;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; 162600#L171-8 assume !(0 == read_history_bool_~history_id); 162601#L181-8 assume !(1 == read_history_bool_~history_id); 162759#L191-8 assume 2 == read_history_bool_~history_id; 162755#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 162751#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 162745#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 162742#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; 162739#L116-10 assume !!(add_history_type_~var~0 < 3); 162737#L117-4 assume !(0 == add_history_type_~history_id); 162729#L123-4 assume !(1 == add_history_type_~history_id); 162667#L129-4 assume 2 == add_history_type_~history_id;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; 162598#L171-8 assume !(0 == read_history_bool_~history_id); 162599#L181-8 assume !(1 == read_history_bool_~history_id); 162459#L191-8 assume 2 == read_history_bool_~history_id; 162460#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 162644#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 162417#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 162418#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; 162584#L116-10 assume !(add_history_type_~var~0 < 3); 162506#L116-11 add_history_type_#res := 1; 162507#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 162387#L263 assume !(0 == init_~tmp___1~1);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; 162388#L116-14 assume !!(add_history_type_~var~0 < 3); 162363#L117-6 assume !(0 == add_history_type_~history_id); 162364#L123-6 assume !(1 == add_history_type_~history_id); 162725#L129-6 assume !(2 == add_history_type_~history_id); 162761#L135-9 assume 3 == add_history_type_~history_id;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; 162758#L151-3 assume 3 == read_history_int8_~history_id; 162754#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162750#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 162744#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 162741#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; 162479#L116-14 assume !!(add_history_type_~var~0 < 3); 162365#L117-6 assume !(0 == add_history_type_~history_id); 162366#L123-6 assume !(1 == add_history_type_~history_id); 162648#L129-6 assume !(2 == add_history_type_~history_id); 162564#L135-9 assume 3 == add_history_type_~history_id;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; 162565#L151-3 assume 3 == read_history_int8_~history_id; 162588#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162589#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 162591#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 162551#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; 162552#L116-14 assume !!(add_history_type_~var~0 < 3); 162736#L117-6 assume !(0 == add_history_type_~history_id); 162724#L123-6 assume !(1 == add_history_type_~history_id); 162647#L129-6 assume !(2 == add_history_type_~history_id); 162562#L135-9 assume 3 == add_history_type_~history_id;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; 162563#L151-3 assume 3 == read_history_int8_~history_id; 162586#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162587#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 162590#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 162550#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; 162478#L116-14 assume !(add_history_type_~var~0 < 3); 162476#L116-15 add_history_type_#res := 1; 162477#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 162684#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 162629#L270 main_#t~ret57 := init_#res;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; 162630#L550-2 assume !!(main_~i2~0 < 10);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;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; 162621#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; 162573#L570-16 assume 0 != ~gate1Failed~0 % 256; 162574#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 162618#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; 163462#L409 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;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; 163461#L226-2 assume !(0 == write_history_bool_~history_id); 163459#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; 163458#L570-17 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; 163457#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 163456#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 163455#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 162450#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; 162451#L440 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;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; 162568#L226-4 assume !(0 == write_history_bool_~history_id); 162569#L231-4 assume !(1 == write_history_bool_~history_id); 162693#L236-4 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; 162525#L570-18 assume 0 != ~gate3Failed~0 % 256; 162527#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 163485#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; 163484#L471 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; 162429#L486 assume ~VALUE1~0 == ~VALUE2~0; 162430#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 162530#L570-19 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; 162531#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; 162536#L570-20 ~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;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; 162537#L294 assume !(0 == ~gate1Failed~0 % 256); 162678#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 162679#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 162579#L171-12 assume 0 == read_history_bool_~history_id; 162409#L172-12 assume !(0 == read_history_bool_~historyIndex); 162410#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 162690#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 162414#L307 assume !(0 == check_~tmp___3~0 % 256); 162415#L307-1 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; 162422#L151-7 assume 3 == read_history_int8_~history_id; 162642#L152-7 assume !(0 == read_history_int8_~historyIndex); 162867#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 162864#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 162861#L346 assume !(check_~tmp___10~0 > -2); 162858#L346-1 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; 162855#L151-9 assume 3 == read_history_int8_~history_id; 162850#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162845#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 162840#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 162835#L366-1 check_#res := 1; 162538#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 162539#L575-72 assume !(0 == assert_~arg % 256); 162445#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 162446#L550-2 assume !!(main_~i2~0 < 10);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;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; 162697#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; 162880#L570-16 assume 0 != ~gate1Failed~0 % 256; 162869#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 162631#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; 162632#L409 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;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; 163209#L226-2 assume !(0 == write_history_bool_~history_id); 163200#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; 163197#L570-17 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; 163195#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 163193#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 163191#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 163189#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; 163187#L440 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;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; 163185#L226-4 assume !(0 == write_history_bool_~history_id); 163181#L231-4 assume !(1 == write_history_bool_~history_id); 163171#L236-4 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; 163165#L570-18 assume 0 != ~gate3Failed~0 % 256; 163161#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 163157#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; 163153#L471 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; 163149#L486 assume !(~VALUE1~0 == ~VALUE2~0); 163133#L493 assume !(~VALUE1~0 == ~VALUE3~0); 163128#L500 assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE1~0; 163116#L570-19 [2019-01-02 00:13:17,441 INFO L796 eck$LassoCheckResult]: Loop: 163116#L570-19 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; 163112#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; 163108#L570-20 ~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;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; 163104#L294 assume !(0 == ~gate1Failed~0 % 256); 163099#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 163098#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 163094#L171-12 assume 0 == read_history_bool_~history_id; 163090#L172-12 assume !(0 == read_history_bool_~historyIndex); 163086#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 163006#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 162888#L307 assume !(0 == check_~tmp___3~0 % 256); 162886#L307-1 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; 162640#L151-7 assume 3 == read_history_int8_~history_id; 162641#L152-7 assume !(0 == read_history_int8_~historyIndex); 162452#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 162453#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 162732#L346 assume !(check_~tmp___10~0 > -2); 162733#L346-1 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; 162694#L151-9 assume 3 == read_history_int8_~history_id; 162695#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162473#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 162474#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 162649#L366-1 check_#res := 1; 162650#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 163084#L575-72 assume !(0 == assert_~arg % 256); 163083#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 163082#L550-2 assume !!(main_~i2~0 < 10);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;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; 163079#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; 163077#L570-16 assume 0 != ~gate1Failed~0 % 256; 163075#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 163073#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; 163071#L409 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;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; 163069#L226-2 assume !(0 == write_history_bool_~history_id); 163066#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; 163063#L570-17 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; 163061#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 163059#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 163057#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 163055#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; 163053#L440 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;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; 163051#L226-4 assume !(0 == write_history_bool_~history_id); 163049#L231-4 assume !(1 == write_history_bool_~history_id); 163047#L236-4 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; 163042#L570-18 assume 0 != ~gate3Failed~0 % 256; 163038#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 163035#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; 163032#L471 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; 163028#L486 assume !(~VALUE1~0 == ~VALUE2~0); 163029#L493 assume !(~VALUE1~0 == ~VALUE3~0); 163132#L500 assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE1~0; 163116#L570-19 [2019-01-02 00:13:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:13:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1306939890, now seen corresponding path program 1 times [2019-01-02 00:13:17,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:13:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:13:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:13:17,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:13:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:13:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:13:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-02 00:13:17,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:13:17,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:13:17,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:13:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:13:17,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:13:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-02 00:13:18,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:13:18,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2019-01-02 00:13:18,249 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:13:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:13:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -846001062, now seen corresponding path program 1 times [2019-01-02 00:13:18,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:13:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:13:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:13:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:13:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:13:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:13:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:13:19,401 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 261 DAG size of output: 228 [2019-01-02 00:13:21,170 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2019-01-02 00:13:21,176 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:13:21,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:13:21,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:13:21,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:13:21,176 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:13:21,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:21,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:13:21,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:13:21,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration35_Loop [2019-01-02 00:13:21,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:13:21,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:13:21,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,626 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-02 00:13:21,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:21,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:22,278 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-02 00:13:22,645 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:13:22,658 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-02 00:13:36,055 WARN L181 SmtUtils]: Spent 13.24 s on a formula simplification. DAG size of input: 245 DAG size of output: 141 [2019-01-02 00:13:36,273 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:13:36,273 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,280 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 269 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,293 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,318 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 270 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,328 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,353 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 271 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,363 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,363 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,388 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 272 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,399 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,424 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 273 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,435 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,461 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 274 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,471 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,471 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___0~2=0} Honda state: {ULTIMATE.start_check_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,498 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 275 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,509 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,535 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 276 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,546 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,546 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_33=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_33=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,574 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 277 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,612 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 278 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,623 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,623 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,649 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 279 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,660 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,660 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,686 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 280 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,698 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,698 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,725 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 281 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,737 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,763 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 282 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,775 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,775 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,801 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 283 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,811 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,811 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,843 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 284 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,855 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,879 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 285 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,891 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,917 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 286 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,955 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 287 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:36,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:36,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:36,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:36,989 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 288 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,001 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,029 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 289 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,043 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,070 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 290 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,083 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,111 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 291 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,124 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,124 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,149 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 292 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,174 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_33=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_33=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,180 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 293 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,193 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,218 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 294 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,231 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:13:37,288 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,288 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,310 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 296 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,333 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,334 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_33=3} Honda state: {v_rep#funAddr~voter.offset_33=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,339 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 297 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:37,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:13:37,352 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:37,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:13:37,382 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 298 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:13:38,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:13:38,156 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 299 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:50,748 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:13:50,767 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:13:50,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:13:50,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:13:50,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:13:50,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:13:50,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:13:50,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:13:50,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:13:50,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration35_Loop [2019-01-02 00:13:50,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:13:50,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:13:50,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:50,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,195 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-02 00:13:51,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:13:51,693 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-02 00:13:52,668 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-02 00:13:53,084 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:13:53,095 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-02 00:14:06,566 WARN L181 SmtUtils]: Spent 13.41 s on a formula simplification. DAG size of input: 245 DAG size of output: 141 [2019-01-02 00:14:06,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:14:06,792 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:14:06,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:06,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:06,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,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 [2019-01-02 00:14:06,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,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 [2019-01-02 00:14:06,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:06,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:06,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:06,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:06,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:06,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:06,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:06,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:06,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:06,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:06,828 INFO L206 nArgumentSynthesizer]: 24 loop disjuncts [2019-01-02 00:14:06,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:06,853 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2019-01-02 00:14:06,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:07,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:07,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:07,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:07,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:07,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:07,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:07,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:07,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:07,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:07,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:07,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:07,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:07,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:14:07,067 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:14:07,067 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:14:07,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:14:07,068 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:14:07,068 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:14:07,068 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:14:07,068 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:14:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:07,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:14:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:07,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:14:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:14:08,403 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 [2019-01-02 00:14:08,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1128 states and 1389 transitions. cyclomatic complexity: 269 Second operand 5 states. [2019-01-02 00:14:08,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1128 states and 1389 transitions. cyclomatic complexity: 269. Second operand 5 states. Result 2354 states and 2899 transitions. Complement of second has 6 states. [2019-01-02 00:14:08,606 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 [2019-01-02 00:14:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:14:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2019-01-02 00:14:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 341 transitions. Stem has 203 letters. Loop has 50 letters. [2019-01-02 00:14:08,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:14:08,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 341 transitions. Stem has 253 letters. Loop has 50 letters. [2019-01-02 00:14:08,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:14:08,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 341 transitions. Stem has 203 letters. Loop has 100 letters. [2019-01-02 00:14:08,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:14:08,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2354 states and 2899 transitions. [2019-01-02 00:14:08,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2019-01-02 00:14:08,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2354 states to 926 states and 1132 transitions. [2019-01-02 00:14:08,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2019-01-02 00:14:08,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-01-02 00:14:08,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 926 states and 1132 transitions. [2019-01-02 00:14:08,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:08,619 INFO L705 BuchiCegarLoop]: Abstraction has 926 states and 1132 transitions. [2019-01-02 00:14:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states and 1132 transitions. [2019-01-02 00:14:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-01-02 00:14:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-01-02 00:14:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1132 transitions. [2019-01-02 00:14:08,627 INFO L728 BuchiCegarLoop]: Abstraction has 926 states and 1132 transitions. [2019-01-02 00:14:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-02 00:14:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-01-02 00:14:08,628 INFO L87 Difference]: Start difference. First operand 926 states and 1132 transitions. Second operand 16 states. [2019-01-02 00:14:09,978 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-02 00:14:10,751 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-02 00:14:14,873 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:14:16,427 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:14:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:14:16,442 INFO L93 Difference]: Finished difference Result 9561 states and 11489 transitions. [2019-01-02 00:14:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-02 00:14:16,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9561 states and 11489 transitions. [2019-01-02 00:14:16,476 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3036 [2019-01-02 00:14:16,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9561 states to 8721 states and 10481 transitions. [2019-01-02 00:14:16,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4081 [2019-01-02 00:14:16,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4081 [2019-01-02 00:14:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8721 states and 10481 transitions. [2019-01-02 00:14:16,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:16,495 INFO L705 BuchiCegarLoop]: Abstraction has 8721 states and 10481 transitions. [2019-01-02 00:14:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states and 10481 transitions. [2019-01-02 00:14:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 3535. [2019-01-02 00:14:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2019-01-02 00:14:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4289 transitions. [2019-01-02 00:14:16,549 INFO L728 BuchiCegarLoop]: Abstraction has 3535 states and 4289 transitions. [2019-01-02 00:14:16,549 INFO L608 BuchiCegarLoop]: Abstraction has 3535 states and 4289 transitions. [2019-01-02 00:14:16,549 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2019-01-02 00:14:16,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3535 states and 4289 transitions. [2019-01-02 00:14:16,557 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1172 [2019-01-02 00:14:16,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:14:16,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:14:16,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:14:16,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-02 00:14:16,561 INFO L794 eck$LassoCheckResult]: Stem: 178283#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 177989#L-1 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;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;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; 177990#L116-2 assume !!(add_history_type_~var~0 < 3); 178142#L117 assume 0 == add_history_type_~history_id;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; 178481#L171 assume 0 == read_history_bool_~history_id; 178477#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 178478#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 178471#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 178472#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; 178467#L116-2 assume !!(add_history_type_~var~0 < 3); 178468#L117 assume 0 == add_history_type_~history_id;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; 178211#L171 assume 0 == read_history_bool_~history_id; 178212#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 177952#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 178185#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 178186#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; 178143#L116-2 assume !!(add_history_type_~var~0 < 3); 178144#L117 assume 0 == add_history_type_~history_id;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; 178461#L171 assume 0 == read_history_bool_~history_id; 178462#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 178453#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 178452#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 178443#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; 178384#L116-2 assume !(add_history_type_~var~0 < 3); 178134#L116-3 add_history_type_#res := 1; 178135#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 177991#L255 assume !(0 == init_~tmp~1);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; 177992#L116-6 assume !!(add_history_type_~var~0 < 3); 177983#L117-2 assume !(0 == add_history_type_~history_id); 177984#L123-2 assume 1 == add_history_type_~history_id;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; 179244#L171-4 assume !(0 == read_history_bool_~history_id); 179243#L181-4 assume 1 == read_history_bool_~history_id; 178441#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 178439#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 178434#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 178435#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; 178193#L116-6 assume !!(add_history_type_~var~0 < 3); 178194#L117-2 assume !(0 == add_history_type_~history_id); 178448#L123-2 assume 1 == add_history_type_~history_id;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; 178449#L171-4 assume !(0 == read_history_bool_~history_id); 178311#L181-4 assume 1 == read_history_bool_~history_id; 178312#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 179236#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 179235#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 179234#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; 179233#L116-6 assume !!(add_history_type_~var~0 < 3); 178367#L117-2 assume !(0 == add_history_type_~history_id); 179232#L123-2 assume 1 == add_history_type_~history_id;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; 179231#L171-4 assume !(0 == read_history_bool_~history_id); 179230#L181-4 assume 1 == read_history_bool_~history_id; 178398#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 178396#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 178378#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 178379#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; 178365#L116-6 assume !(add_history_type_~var~0 < 3); 178366#L116-7 add_history_type_#res := 1; 178301#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 178302#L259 assume !(0 == init_~tmp___0~1);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; 178380#L116-10 assume !!(add_history_type_~var~0 < 3); 178381#L117-4 assume !(0 == add_history_type_~history_id); 178427#L123-4 assume !(1 == add_history_type_~history_id); 178428#L129-4 assume 2 == add_history_type_~history_id;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; 178419#L171-8 assume !(0 == read_history_bool_~history_id); 178420#L181-8 assume !(1 == read_history_bool_~history_id); 178411#L191-8 assume 2 == read_history_bool_~history_id; 178412#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 178393#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 178394#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 178382#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; 178383#L116-10 assume !!(add_history_type_~var~0 < 3); 177971#L117-4 assume !(0 == add_history_type_~history_id); 177972#L123-4 assume !(1 == add_history_type_~history_id); 178260#L129-4 assume 2 == add_history_type_~history_id;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; 178261#L171-8 assume !(0 == read_history_bool_~history_id); 178329#L181-8 assume !(1 == read_history_bool_~history_id); 178330#L191-8 assume 2 == read_history_bool_~history_id; 178332#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 178239#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 178008#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 178009#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; 178376#L116-10 assume !!(add_history_type_~var~0 < 3); 178377#L117-4 assume !(0 == add_history_type_~history_id); 178357#L123-4 assume !(1 == add_history_type_~history_id); 178358#L129-4 assume 2 == add_history_type_~history_id;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; 178189#L171-8 assume !(0 == read_history_bool_~history_id); 178190#L181-8 assume !(1 == read_history_bool_~history_id); 178047#L191-8 assume 2 == read_history_bool_~history_id; 178048#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 178334#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 178335#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 178205#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; 178206#L116-10 assume !(add_history_type_~var~0 < 3); 178090#L116-11 add_history_type_#res := 1; 178091#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 177977#L263 assume !(0 == init_~tmp___1~1);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; 177978#L116-14 assume !!(add_history_type_~var~0 < 3); 177953#L117-6 assume !(0 == add_history_type_~history_id); 177954#L123-6 assume !(1 == add_history_type_~history_id); 178421#L129-6 assume !(2 == add_history_type_~history_id); 178422#L135-9 assume 3 == add_history_type_~history_id;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; 178413#L151-3 assume 3 == read_history_int8_~history_id; 178414#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 178400#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 178401#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 178385#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; 178386#L116-14 assume !!(add_history_type_~var~0 < 3); 177955#L117-6 assume !(0 == add_history_type_~history_id); 177956#L123-6 assume !(1 == add_history_type_~history_id); 178242#L129-6 assume !(2 == add_history_type_~history_id); 178243#L135-9 assume 3 == add_history_type_~history_id;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; 178279#L151-3 assume 3 == read_history_int8_~history_id; 178280#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 178181#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 178182#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 178138#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; 178139#L116-14 assume !!(add_history_type_~var~0 < 3); 178368#L117-6 assume !(0 == add_history_type_~history_id); 178369#L123-6 assume !(1 == add_history_type_~history_id); 178240#L129-6 assume !(2 == add_history_type_~history_id); 178241#L135-9 assume 3 == add_history_type_~history_id;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; 178277#L151-3 assume 3 == read_history_int8_~history_id; 178278#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 178179#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 178180#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 178136#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; 178137#L116-14 assume !(add_history_type_~var~0 < 3); 178063#L116-15 add_history_type_#res := 1; 178064#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 178284#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 178285#L270 main_#t~ret57 := init_#res;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; 179222#L550-2 assume !!(main_~i2~0 < 10);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;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; 179220#L226 assume !(0 == write_history_bool_~history_id); 179218#L231 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; 179217#L570-16 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; 179216#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 179215#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 179214#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; 179213#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; 179212#L409 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;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; 179211#L226-2 assume !(0 == write_history_bool_~history_id); 179209#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; 179208#L570-17 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; 179207#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 179206#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 179205#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 179204#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; 179203#L440 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;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; 179202#L226-4 assume !(0 == write_history_bool_~history_id); 179201#L231-4 assume !(1 == write_history_bool_~history_id); 179200#L236-4 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; 179198#L570-18 assume 0 != ~gate3Failed~0 % 256; 179197#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 179196#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; 179195#L471 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; 179194#L486 assume ~VALUE1~0 == ~VALUE2~0; 179175#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 179192#L570-19 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; 179190#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; 179179#L570-20 ~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;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; 179177#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 179157#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 179154#L171-12 assume 0 == read_history_bool_~history_id; 179150#L172-12 assume !(0 == read_history_bool_~historyIndex); 179147#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 179143#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 179090#L307 assume !(0 == check_~tmp___3~0 % 256); 179085#L307-1 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; 179084#L151-7 assume 3 == read_history_int8_~history_id; 179083#L152-7 assume !(0 == read_history_int8_~historyIndex); 179082#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 179081#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 179080#L346 assume !(check_~tmp___10~0 > -2); 179079#L346-1 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; 179078#L151-9 assume 3 == read_history_int8_~history_id; 179076#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 179074#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 179071#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 179068#L366-1 check_#res := 1; 179069#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 179749#L575-72 assume !(0 == assert_~arg % 256); 179744#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 179739#L550-2 assume !!(main_~i2~0 < 10);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;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; 179725#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; 179718#L570-16 assume 0 != ~gate1Failed~0 % 256; 179713#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 179711#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; 179709#L409 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;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; 179707#L226-2 assume !(0 == write_history_bool_~history_id); 179704#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; 179701#L570-17 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; 179699#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 179697#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 179695#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 179693#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; 179691#L440 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;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; 179689#L226-4 assume !(0 == write_history_bool_~history_id); 179687#L231-4 assume !(1 == write_history_bool_~history_id); 179685#L236-4 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; 179682#L570-18 assume 0 != ~gate3Failed~0 % 256; 179679#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 179677#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; 179646#L471 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; 179644#L486 assume !(~VALUE1~0 == ~VALUE2~0); 179641#L493 assume !(~VALUE1~0 == ~VALUE3~0); 179639#L500 assume !(~VALUE1~0 != ~nomsg~0); 179637#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 179634#L570-19 [2019-01-02 00:14:16,561 INFO L796 eck$LassoCheckResult]: Loop: 179634#L570-19 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; 179633#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; 179632#L570-20 ~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;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; 178573#L294 assume !(0 == ~gate1Failed~0 % 256); 178574#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 179669#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 179667#L171-12 assume !(0 == read_history_bool_~history_id); 179668#L181-12 assume !(1 == read_history_bool_~history_id); 179672#L191-12 assume 2 == read_history_bool_~history_id; 179673#L192-12 assume !(0 == read_history_bool_~historyIndex); 179619#L195-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_1~0; 179620#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 179599#L307 assume !(0 == check_~tmp___3~0 % 256); 179593#L307-1 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; 179590#L151-7 assume 3 == read_history_int8_~history_id; 179587#L152-7 assume !(0 == read_history_int8_~historyIndex); 179584#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 179581#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 179578#L346 assume !(check_~tmp___10~0 > -2); 179576#L346-1 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; 179572#L151-9 assume 3 == read_history_int8_~history_id; 179573#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 180677#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 180675#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 180673#L366-1 check_#res := 1; 180603#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 180601#L575-72 assume !(0 == assert_~arg % 256); 180599#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 180597#L550-2 assume !!(main_~i2~0 < 10);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;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; 180595#L226 assume !(0 == write_history_bool_~history_id); 180582#L231 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; 180579#L570-16 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; 180580#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 180682#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 180681#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; 180661#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; 180660#L409 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;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; 180659#L226-2 assume !(0 == write_history_bool_~history_id); 180655#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; 180653#L570-17 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; 180652#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 180604#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 180602#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 180600#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; 180598#L440 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;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; 180596#L226-4 assume !(0 == write_history_bool_~history_id); 180594#L231-4 assume !(1 == write_history_bool_~history_id); 180593#L236-4 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; 180592#L570-18 assume 0 != ~gate3Failed~0 % 256; 180591#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 180587#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; 180586#L471 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; 180585#L486 assume ~VALUE1~0 == ~VALUE2~0; 180436#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 180531#L570-19 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; 180529#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; 180527#L570-20 ~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;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; 180525#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 178291#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 180521#L171-12 assume !(0 == read_history_bool_~history_id); 180522#L181-12 assume !(1 == read_history_bool_~history_id); 180520#L191-12 assume 2 == read_history_bool_~history_id; 180518#L192-12 assume !(0 == read_history_bool_~historyIndex); 180515#L195-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_1~0; 180516#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 181429#L307 assume !(0 == check_~tmp___3~0 % 256); 178010#L307-1 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; 178011#L151-7 assume 3 == read_history_int8_~history_id; 178069#L152-7 assume !(0 == read_history_int8_~historyIndex); 178039#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 178040#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 178072#L346 assume !(check_~tmp___10~0 > -2); 178342#L346-1 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; 178303#L151-9 assume 3 == read_history_int8_~history_id; 178304#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 179570#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 179559#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 178244#L366-1 check_#res := 1; 178124#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 178125#L575-72 assume !(0 == assert_~arg % 256); 179738#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 179736#L550-2 assume !!(main_~i2~0 < 10);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;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; 179734#L226 assume !(0 == write_history_bool_~history_id); 179723#L231 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; 179716#L570-16 assume 0 != ~gate1Failed~0 % 256; 179712#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 179710#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; 179708#L409 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;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; 179706#L226-2 assume !(0 == write_history_bool_~history_id); 179702#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; 179700#L570-17 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; 179698#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 179696#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 179694#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 179692#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; 179690#L440 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;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; 179688#L226-4 assume !(0 == write_history_bool_~history_id); 179686#L231-4 assume !(1 == write_history_bool_~history_id); 179684#L236-4 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; 179680#L570-18 assume 0 != ~gate3Failed~0 % 256; 179678#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 179676#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; 179645#L471 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; 179642#L486 assume !(~VALUE1~0 == ~VALUE2~0); 179640#L493 assume !(~VALUE1~0 == ~VALUE3~0); 179638#L500 assume !(~VALUE1~0 != ~nomsg~0); 179635#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 179634#L570-19 [2019-01-02 00:14:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1453205744, now seen corresponding path program 1 times [2019-01-02 00:14:16,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:16,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-01-02 00:14:16,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:16,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:14:16,669 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:14:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash 525631029, now seen corresponding path program 1 times [2019-01-02 00:14:16,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:16,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-02 00:14:16,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:16,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:14:16,738 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:14:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:14:16,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:14:16,739 INFO L87 Difference]: Start difference. First operand 3535 states and 4289 transitions. cyclomatic complexity: 771 Second operand 3 states. [2019-01-02 00:14:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:14:16,901 INFO L93 Difference]: Finished difference Result 5169 states and 6218 transitions. [2019-01-02 00:14:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:14:16,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5169 states and 6218 transitions. [2019-01-02 00:14:16,920 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1556 [2019-01-02 00:14:16,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5169 states to 5099 states and 6148 transitions. [2019-01-02 00:14:16,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2339 [2019-01-02 00:14:16,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2339 [2019-01-02 00:14:16,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5099 states and 6148 transitions. [2019-01-02 00:14:16,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:16,934 INFO L705 BuchiCegarLoop]: Abstraction has 5099 states and 6148 transitions. [2019-01-02 00:14:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5099 states and 6148 transitions. [2019-01-02 00:14:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5099 to 3375. [2019-01-02 00:14:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3375 states. [2019-01-02 00:14:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4074 transitions. [2019-01-02 00:14:16,972 INFO L728 BuchiCegarLoop]: Abstraction has 3375 states and 4074 transitions. [2019-01-02 00:14:16,972 INFO L608 BuchiCegarLoop]: Abstraction has 3375 states and 4074 transitions. [2019-01-02 00:14:16,972 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2019-01-02 00:14:16,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3375 states and 4074 transitions. [2019-01-02 00:14:16,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1116 [2019-01-02 00:14:16,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:14:16,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:14:16,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:14:16,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-02 00:14:16,982 INFO L794 eck$LassoCheckResult]: Stem: 186987#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 186696#L-1 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;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;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; 186697#L116-2 assume !!(add_history_type_~var~0 < 3); 186846#L117 assume 0 == add_history_type_~history_id;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; 187185#L171 assume 0 == read_history_bool_~history_id; 186753#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 186754#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 187055#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 186898#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; 186899#L116-2 assume !!(add_history_type_~var~0 < 3); 186751#L117 assume 0 == add_history_type_~history_id;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; 186752#L171 assume 0 == read_history_bool_~history_id; 187181#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 187179#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 187180#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 187175#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; 187176#L116-2 assume !!(add_history_type_~var~0 < 3); 187157#L117 assume 0 == add_history_type_~history_id;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; 187158#L171 assume 0 == read_history_bool_~history_id; 187147#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 187143#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 187144#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 187136#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; 187137#L116-2 assume !(add_history_type_~var~0 < 3); 186838#L116-3 add_history_type_#res := 1; 186839#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 186698#L255 assume !(0 == init_~tmp~1);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; 186699#L116-6 assume !!(add_history_type_~var~0 < 3); 187172#L117-2 assume !(0 == add_history_type_~history_id); 187173#L123-2 assume 1 == add_history_type_~history_id;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; 186844#L171-4 assume !(0 == read_history_bool_~history_id); 186845#L181-4 assume 1 == read_history_bool_~history_id; 187162#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 187160#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 187151#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 187152#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; 186896#L116-6 assume !!(add_history_type_~var~0 < 3); 186897#L117-2 assume !(0 == add_history_type_~history_id); 187170#L123-2 assume 1 == add_history_type_~history_id;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; 187171#L171-4 assume !(0 == read_history_bool_~history_id); 187166#L181-4 assume 1 == read_history_bool_~history_id; 187167#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 187014#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 187015#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 186921#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; 186922#L116-6 assume !!(add_history_type_~var~0 < 3); 187070#L117-2 assume !(0 == add_history_type_~history_id); 187138#L123-2 assume 1 == add_history_type_~history_id;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; 187129#L171-4 assume !(0 == read_history_bool_~history_id); 187130#L181-4 assume 1 == read_history_bool_~history_id; 187096#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 187094#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 187081#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 187082#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; 187068#L116-6 assume !(add_history_type_~var~0 < 3); 187069#L116-7 add_history_type_#res := 1; 187000#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 187001#L259 assume !(0 == init_~tmp___0~1);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; 187066#L116-10 assume !!(add_history_type_~var~0 < 3); 187067#L117-4 assume !(0 == add_history_type_~history_id); 187127#L123-4 assume !(1 == add_history_type_~history_id); 187128#L129-4 assume 2 == add_history_type_~history_id;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; 187121#L171-8 assume !(0 == read_history_bool_~history_id); 187122#L181-8 assume !(1 == read_history_bool_~history_id); 187113#L191-8 assume 2 == read_history_bool_~history_id; 187114#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 187037#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 187038#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 186911#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; 186912#L116-10 assume !!(add_history_type_~var~0 < 3); 186682#L117-4 assume !(0 == add_history_type_~history_id); 186683#L123-4 assume !(1 == add_history_type_~history_id); 186966#L129-4 assume 2 == add_history_type_~history_id;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; 186967#L171-8 assume !(0 == read_history_bool_~history_id); 187031#L181-8 assume !(1 == read_history_bool_~history_id); 187032#L191-8 assume 2 == read_history_bool_~history_id; 187034#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 186946#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 187091#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 187092#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; 187079#L116-10 assume !!(add_history_type_~var~0 < 3); 187080#L117-4 assume !(0 == add_history_type_~history_id); 187056#L123-4 assume !(1 == add_history_type_~history_id); 187057#L129-4 assume 2 == add_history_type_~history_id;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; 186890#L171-8 assume !(0 == read_history_bool_~history_id); 186891#L181-8 assume !(1 == read_history_bool_~history_id); 186755#L191-8 assume 2 == read_history_bool_~history_id; 186756#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 187035#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 187036#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 186909#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; 186910#L116-10 assume !(add_history_type_~var~0 < 3); 186799#L116-11 add_history_type_#res := 1; 186800#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 186688#L263 assume !(0 == init_~tmp___1~1);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; 186689#L116-14 assume !!(add_history_type_~var~0 < 3); 186664#L117-6 assume !(0 == add_history_type_~history_id); 186665#L123-6 assume !(1 == add_history_type_~history_id); 186949#L129-6 assume !(2 == add_history_type_~history_id); 186950#L135-9 assume 3 == add_history_type_~history_id;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; 186984#L151-3 assume 3 == read_history_int8_~history_id; 186985#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 186882#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 186883#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 186842#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; 186843#L116-14 assume !!(add_history_type_~var~0 < 3); 186666#L117-6 assume !(0 == add_history_type_~history_id); 186667#L123-6 assume !(1 == add_history_type_~history_id); 187119#L129-6 assume !(2 == add_history_type_~history_id); 187120#L135-9 assume 3 == add_history_type_~history_id;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; 187111#L151-3 assume 3 == read_history_int8_~history_id; 187112#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 187098#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 187099#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 187083#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; 187084#L116-14 assume !!(add_history_type_~var~0 < 3); 187071#L117-6 assume !(0 == add_history_type_~history_id); 187072#L123-6 assume !(1 == add_history_type_~history_id); 186947#L129-6 assume !(2 == add_history_type_~history_id); 186948#L135-9 assume 3 == add_history_type_~history_id;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; 186982#L151-3 assume 3 == read_history_int8_~history_id; 186983#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 186880#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 186881#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 186840#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; 186841#L116-14 assume !(add_history_type_~var~0 < 3); 186772#L116-15 add_history_type_#res := 1; 186773#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 186988#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 186989#L270 main_#t~ret57 := init_#res;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; 189008#L550-2 assume !!(main_~i2~0 < 10);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;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; 189009#L226 assume !(0 == write_history_bool_~history_id); 189734#L231 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; 189732#L570-16 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; 189730#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 189728#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 189726#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; 189724#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; 189722#L409 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;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; 189720#L226-2 assume !(0 == write_history_bool_~history_id); 189714#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; 189712#L570-17 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; 189710#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 189708#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 189706#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 189704#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; 189702#L440 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;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; 189699#L226-4 assume !(0 == write_history_bool_~history_id); 189698#L231-4 assume !(1 == write_history_bool_~history_id); 189691#L236-4 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; 189686#L570-18 assume 0 != ~gate3Failed~0 % 256; 189681#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 189677#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; 189637#L471 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; 188942#L486 assume ~VALUE1~0 == ~VALUE2~0; 188940#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 188938#L570-19 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; 188936#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; 188931#L570-20 ~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;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; 188899#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 188895#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 188893#L171-12 assume 0 == read_history_bool_~history_id; 188891#L172-12 assume !(0 == read_history_bool_~historyIndex); 188889#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 188887#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 188817#L307 assume !(0 == check_~tmp___3~0 % 256); 188809#L307-1 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; 188800#L151-7 assume 3 == read_history_int8_~history_id; 188781#L152-7 assume !(0 == read_history_int8_~historyIndex); 188763#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 188751#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 188652#L346 assume !(check_~tmp___10~0 > -2); 188650#L346-1 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; 188648#L151-9 assume 3 == read_history_int8_~history_id; 188646#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 188644#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 188642#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 188639#L366-1 check_#res := 1; 188637#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 188635#L575-72 assume !(0 == assert_~arg % 256); 188633#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 188629#L550-2 assume !!(main_~i2~0 < 10);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;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; 188548#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; 188546#L570-16 assume 0 != ~gate1Failed~0 % 256; 188524#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 188170#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; 188168#L409 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;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; 188166#L226-2 assume !(0 == write_history_bool_~history_id); 188162#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; 188161#L570-17 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; 188160#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 188159#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 188114#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 188107#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; 188103#L440 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;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; 188097#L226-4 assume !(0 == write_history_bool_~history_id); 188091#L231-4 assume !(1 == write_history_bool_~history_id); 188085#L236-4 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; 188079#L570-18 assume 0 != ~gate3Failed~0 % 256; 188080#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 188088#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; 188082#L471 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; 188071#L486 assume !(~VALUE1~0 == ~VALUE2~0); 188070#L493 assume !(~VALUE1~0 == ~VALUE3~0); 188069#L500 assume !(~VALUE1~0 != ~nomsg~0); 187739#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 187737#L570-19 [2019-01-02 00:14:16,983 INFO L796 eck$LassoCheckResult]: Loop: 187737#L570-19 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; 187735#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; 187733#L570-20 ~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;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; 187731#L294 assume !(0 == ~gate1Failed~0 % 256); 187729#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 187727#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 187725#L171-12 assume 0 == read_history_bool_~history_id; 187723#L172-12 assume !(0 == read_history_bool_~historyIndex); 187199#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 187198#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 186708#L307 assume 0 == check_~tmp___3~0 % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 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; 186709#L171-13 assume !(0 == read_history_bool_~history_id); 187847#L181-13 assume 1 == read_history_bool_~history_id; 187839#L182-13 assume !(0 == read_history_bool_~historyIndex); 187832#L185-13 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_1~0; 187826#L203-13 check_#t~ret10 := read_history_bool_#res;check_~tmp___4~0 := check_#t~ret10;havoc check_#t~ret10; 187614#L309 assume !(0 == check_~tmp___4~0 % 256); 187612#L307-1 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; 187610#L151-7 assume 3 == read_history_int8_~history_id; 187608#L152-7 assume !(0 == read_history_int8_~historyIndex); 187606#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 187604#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 187602#L346 assume !(check_~tmp___10~0 > -2); 187600#L346-1 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; 187592#L151-9 assume 3 == read_history_int8_~history_id; 187581#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 187575#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 187554#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 187552#L366-1 check_#res := 1; 187550#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 187548#L575-72 assume !(0 == assert_~arg % 256); 187545#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 187543#L550-2 assume !!(main_~i2~0 < 10);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;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; 187532#L226 assume !(0 == write_history_bool_~history_id); 187448#L231 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; 187443#L570-16 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; 187442#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 187439#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 187437#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; 187435#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; 187433#L409 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;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; 187431#L226-2 assume !(0 == write_history_bool_~history_id); 187427#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; 187425#L570-17 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; 187423#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 187421#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 187418#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 187300#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; 187296#L440 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;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; 187294#L226-4 assume !(0 == write_history_bool_~history_id); 187292#L231-4 assume !(1 == write_history_bool_~history_id); 187290#L236-4 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; 187288#L570-18 assume 0 != ~gate3Failed~0 % 256; 187286#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 187284#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; 187262#L471 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; 187245#L486 assume ~VALUE1~0 == ~VALUE2~0; 187241#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 187242#L570-19 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; 187958#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; 187957#L570-20 ~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;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; 187953#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 187590#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 187579#L171-12 assume 0 == read_history_bool_~history_id; 187573#L172-12 assume !(0 == read_history_bool_~historyIndex); 187568#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 187553#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 187551#L307 assume 0 == check_~tmp___3~0 % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 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; 187549#L171-13 assume !(0 == read_history_bool_~history_id); 187546#L181-13 assume 1 == read_history_bool_~history_id; 187547#L182-13 assume !(0 == read_history_bool_~historyIndex); 187538#L185-13 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_1~0; 187530#L203-13 check_#t~ret10 := read_history_bool_#res;check_~tmp___4~0 := check_#t~ret10;havoc check_#t~ret10; 187368#L309 assume !(0 == check_~tmp___4~0 % 256); 187367#L307-1 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; 187366#L151-7 assume 3 == read_history_int8_~history_id; 187365#L152-7 assume !(0 == read_history_int8_~historyIndex); 187364#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 187363#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 187362#L346 assume !(check_~tmp___10~0 > -2); 187361#L346-1 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; 187360#L151-9 assume 3 == read_history_int8_~history_id; 187359#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 187358#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 187357#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 187356#L366-1 check_#res := 1; 187355#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 187354#L575-72 assume !(0 == assert_~arg % 256); 187353#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 187352#L550-2 assume !!(main_~i2~0 < 10);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;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; 187350#L226 assume !(0 == write_history_bool_~history_id); 187348#L231 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; 187343#L570-16 assume 0 != ~gate1Failed~0 % 256; 187344#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 188158#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; 188068#L409 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;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; 188067#L226-2 assume !(0 == write_history_bool_~history_id); 188065#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; 188064#L570-17 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; 187345#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 187342#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 187340#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 187338#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; 187336#L440 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;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; 187334#L226-4 assume !(0 == write_history_bool_~history_id); 187332#L231-4 assume !(1 == write_history_bool_~history_id); 187330#L236-4 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; 187328#L570-18 assume 0 != ~gate3Failed~0 % 256; 187329#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 187753#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; 187751#L471 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; 187748#L486 assume !(~VALUE1~0 == ~VALUE2~0); 187746#L493 assume !(~VALUE1~0 == ~VALUE3~0); 187744#L500 assume !(~VALUE1~0 != ~nomsg~0); 187742#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 187737#L570-19 [2019-01-02 00:14:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1453205744, now seen corresponding path program 2 times [2019-01-02 00:14:16,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-01-02 00:14:17,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:17,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:14:17,091 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:14:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1944259787, now seen corresponding path program 1 times [2019-01-02 00:14:17,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:17,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:14:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-02 00:14:17,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:17,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:14:17,166 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:14:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:14:17,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:14:17,167 INFO L87 Difference]: Start difference. First operand 3375 states and 4074 transitions. cyclomatic complexity: 716 Second operand 3 states. [2019-01-02 00:14:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:14:17,299 INFO L93 Difference]: Finished difference Result 1566 states and 1863 transitions. [2019-01-02 00:14:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:14:17,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1566 states and 1863 transitions. [2019-01-02 00:14:17,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 368 [2019-01-02 00:14:17,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1566 states to 1566 states and 1863 transitions. [2019-01-02 00:14:17,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2019-01-02 00:14:17,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2019-01-02 00:14:17,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1566 states and 1863 transitions. [2019-01-02 00:14:17,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:17,308 INFO L705 BuchiCegarLoop]: Abstraction has 1566 states and 1863 transitions. [2019-01-02 00:14:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states and 1863 transitions. [2019-01-02 00:14:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1409. [2019-01-02 00:14:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2019-01-02 00:14:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1686 transitions. [2019-01-02 00:14:17,328 INFO L728 BuchiCegarLoop]: Abstraction has 1409 states and 1686 transitions. [2019-01-02 00:14:17,328 INFO L608 BuchiCegarLoop]: Abstraction has 1409 states and 1686 transitions. [2019-01-02 00:14:17,328 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2019-01-02 00:14:17,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1409 states and 1686 transitions. [2019-01-02 00:14:17,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 368 [2019-01-02 00:14:17,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:14:17,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:14:17,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:14:17,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-02 00:14:17,334 INFO L794 eck$LassoCheckResult]: Stem: 191952#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 191644#L-1 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;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;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; 191645#L116-2 assume !!(add_history_type_~var~0 < 3); 191807#L117 assume 0 == add_history_type_~history_id;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; 192373#L171 assume 0 == read_history_bool_~history_id; 191706#L172 assume !(0 == read_history_bool_~historyIndex); 191610#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 191611#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 191847#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 191848#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; 191858#L116-2 assume !!(add_history_type_~var~0 < 3); 192376#L117 assume 0 == add_history_type_~history_id;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; 192375#L171 assume 0 == read_history_bool_~history_id; 192367#L172 assume !(0 == read_history_bool_~historyIndex); 192368#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 192441#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 192150#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 192151#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; 192145#L116-2 assume !!(add_history_type_~var~0 < 3); 192122#L117 assume 0 == add_history_type_~history_id;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; 192133#L171 assume 0 == read_history_bool_~history_id; 192134#L172 assume !(0 == read_history_bool_~historyIndex); 192131#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 192132#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 192125#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 192126#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; 192120#L116-2 assume !(add_history_type_~var~0 < 3); 192121#L116-3 add_history_type_#res := 1; 191895#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 191896#L255 assume !(0 == init_~tmp~1);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; 191855#L116-6 assume !!(add_history_type_~var~0 < 3); 191856#L117-2 assume !(0 == add_history_type_~history_id); 192155#L123-2 assume 1 == add_history_type_~history_id;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; 192156#L171-4 assume !(0 == read_history_bool_~history_id); 191981#L181-4 assume 1 == read_history_bool_~history_id; 191809#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 191810#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 191687#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 191688#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; 191880#L116-6 assume !!(add_history_type_~var~0 < 3); 192360#L117-2 assume !(0 == add_history_type_~history_id); 192359#L123-2 assume 1 == add_history_type_~history_id;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; 192358#L171-4 assume !(0 == read_history_bool_~history_id); 192357#L181-4 assume 1 == read_history_bool_~history_id; 192355#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 192353#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 192352#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 192351#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; 192350#L116-6 assume !!(add_history_type_~var~0 < 3); 192046#L117-2 assume !(0 == add_history_type_~history_id); 192349#L123-2 assume 1 == add_history_type_~history_id;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; 192348#L171-4 assume !(0 == read_history_bool_~history_id); 192347#L181-4 assume 1 == read_history_bool_~history_id; 192073#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 192071#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 192058#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 192059#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; 192044#L116-6 assume !(add_history_type_~var~0 < 3); 192045#L116-7 add_history_type_#res := 1; 191968#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 191969#L259 assume !(0 == init_~tmp___0~1);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; 192042#L116-10 assume !!(add_history_type_~var~0 < 3); 192043#L117-4 assume !(0 == add_history_type_~history_id); 192032#L123-4 assume !(1 == add_history_type_~history_id); 191929#L129-4 assume 2 == add_history_type_~history_id;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; 191930#L171-8 assume !(0 == read_history_bool_~history_id); 192005#L181-8 assume !(1 == read_history_bool_~history_id); 192006#L191-8 assume 2 == read_history_bool_~history_id; 192008#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 191910#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 191663#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 191664#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; 191872#L116-10 assume !!(add_history_type_~var~0 < 3); 191630#L117-4 assume !(0 == add_history_type_~history_id); 191631#L123-4 assume !(1 == add_history_type_~history_id); 192096#L129-4 assume 2 == add_history_type_~history_id;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; 192097#L171-8 assume !(0 == read_history_bool_~history_id); 192090#L181-8 assume !(1 == read_history_bool_~history_id); 192091#L191-8 assume 2 == read_history_bool_~history_id; 192081#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 192082#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 192068#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 192069#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; 192056#L116-10 assume !!(add_history_type_~var~0 < 3); 192057#L117-4 assume !(0 == add_history_type_~history_id); 192030#L123-4 assume !(1 == add_history_type_~history_id); 192031#L129-4 assume 2 == add_history_type_~history_id;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; 191851#L171-8 assume !(0 == read_history_bool_~history_id); 191852#L181-8 assume !(1 == read_history_bool_~history_id); 191708#L191-8 assume 2 == read_history_bool_~history_id; 191709#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 192009#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 192010#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 191870#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; 191871#L116-10 assume !(add_history_type_~var~0 < 3); 191756#L116-11 add_history_type_#res := 1; 191757#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 191636#L263 assume !(0 == init_~tmp___1~1);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; 191637#L116-14 assume !!(add_history_type_~var~0 < 3); 191612#L117-6 assume !(0 == add_history_type_~history_id); 191613#L123-6 assume !(1 == add_history_type_~history_id); 191913#L129-6 assume !(2 == add_history_type_~history_id); 191914#L135-9 assume 3 == add_history_type_~history_id;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; 191948#L151-3 assume 3 == read_history_int8_~history_id; 191949#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191843#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 191844#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 191803#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; 191804#L116-14 assume !!(add_history_type_~var~0 < 3); 191614#L117-6 assume !(0 == add_history_type_~history_id); 191615#L123-6 assume !(1 == add_history_type_~history_id); 192116#L129-6 assume !(2 == add_history_type_~history_id); 192117#L135-9 assume 3 == add_history_type_~history_id;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; 192112#L151-3 assume 3 == read_history_int8_~history_id; 192113#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 192075#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 192076#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 192060#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; 192061#L116-14 assume !!(add_history_type_~var~0 < 3); 192047#L117-6 assume !(0 == add_history_type_~history_id); 192048#L123-6 assume !(1 == add_history_type_~history_id); 191911#L129-6 assume !(2 == add_history_type_~history_id); 191912#L135-9 assume 3 == add_history_type_~history_id;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; 191946#L151-3 assume 3 == read_history_int8_~history_id; 191947#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191841#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 191842#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 191801#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; 191802#L116-14 assume !(add_history_type_~var~0 < 3); 191725#L116-15 add_history_type_#res := 1; 191726#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 191953#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 191954#L270 main_#t~ret57 := init_#res;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; 192335#L550-2 assume !!(main_~i2~0 < 10);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;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; 192330#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; 192329#L570-16 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; 192327#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 192325#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 192323#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; 192321#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; 192319#L409 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;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; 192317#L226-2 assume !(0 == write_history_bool_~history_id); 192313#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; 192311#L570-17 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; 192309#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192307#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192305#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192303#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; 192301#L440 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;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; 192299#L226-4 assume !(0 == write_history_bool_~history_id); 192293#L231-4 assume !(1 == write_history_bool_~history_id); 192289#L236-4 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; 192283#L570-18 assume 0 != ~gate3Failed~0 % 256; 192279#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 192275#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; 192273#L471 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; 192264#L486 assume ~VALUE1~0 == ~VALUE2~0; 192259#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 192254#L570-19 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; 192250#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; 192246#L570-20 ~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;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; 192237#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 192233#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 192231#L171-12 assume 0 == read_history_bool_~history_id; 192229#L172-12 assume !(0 == read_history_bool_~historyIndex); 192227#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 192225#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 192185#L307 assume !(0 == check_~tmp___3~0 % 256); 192182#L307-1 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; 192181#L151-7 assume 3 == read_history_int8_~history_id; 192180#L152-7 assume !(0 == read_history_int8_~historyIndex); 192179#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 192178#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 192177#L346 assume !(check_~tmp___10~0 > -2); 192176#L346-1 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; 192175#L151-9 assume 3 == read_history_int8_~history_id; 192174#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 192173#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 192172#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 192170#L366-1 check_#res := 1; 192169#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 192168#L575-72 assume !(0 == assert_~arg % 256); 192167#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 192166#L550-2 assume !!(main_~i2~0 < 10);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;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; 192165#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; 192164#L570-16 assume 0 != ~gate1Failed~0 % 256; 192161#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 192162#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; 192979#L409 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;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; 192977#L226-2 assume !(0 == write_history_bool_~history_id); 192973#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; 192972#L570-17 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; 192971#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192970#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192969#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192968#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; 192966#L440 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;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; 192964#L226-4 assume !(0 == write_history_bool_~history_id); 192962#L231-4 assume !(1 == write_history_bool_~history_id); 192960#L236-4 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; 192958#L570-18 assume 0 != ~gate3Failed~0 % 256; 192956#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 192955#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; 192954#L471 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; 192952#L486 assume !(~VALUE1~0 == ~VALUE2~0); 192950#L493 assume !(~VALUE1~0 == ~VALUE3~0); 192948#L500 assume !(~VALUE1~0 != ~nomsg~0); 192931#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 192929#L570-19 [2019-01-02 00:14:17,334 INFO L796 eck$LassoCheckResult]: Loop: 192929#L570-19 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; 192927#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; 192922#L570-20 ~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;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; 192916#L294 assume !(0 == ~gate1Failed~0 % 256); 192865#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 192863#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 192861#L171-12 assume 0 == read_history_bool_~history_id; 192860#L172-12 assume !(0 == read_history_bool_~historyIndex); 192859#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 192856#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 192749#L307 assume !(0 == check_~tmp___3~0 % 256); 191657#L307-1 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; 191904#L151-7 assume 3 == read_history_int8_~history_id; 191905#L152-7 assume !(0 == read_history_int8_~historyIndex); 191700#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 191701#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 192036#L346 assume !(check_~tmp___10~0 > -2); 192037#L346-1 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; 191970#L151-9 assume 3 == read_history_int8_~history_id; 191971#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191722#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 191723#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 191915#L366-1 check_#res := 1; 191916#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 192848#L575-72 assume !(0 == assert_~arg % 256); 192846#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 192844#L550-2 assume !!(main_~i2~0 < 10);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;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; 192842#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; 192840#L570-16 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; 192837#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 192835#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 192833#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; 192831#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; 192829#L409 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;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; 192826#L226-2 assume !(0 == write_history_bool_~history_id); 192823#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; 192821#L570-17 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; 192819#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192817#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192815#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192813#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; 192811#L440 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;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; 192809#L226-4 assume !(0 == write_history_bool_~history_id); 192807#L231-4 assume !(1 == write_history_bool_~history_id); 192804#L236-4 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; 192803#L570-18 assume 0 != ~gate3Failed~0 % 256; 191680#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 191624#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; 191625#L471 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; 192770#L486 assume ~VALUE1~0 == ~VALUE2~0; 192768#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 192766#L570-19 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; 192764#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; 192762#L570-20 ~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;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; 192759#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 192755#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 192754#L171-12 assume 0 == read_history_bool_~history_id; 192753#L172-12 assume !(0 == read_history_bool_~historyIndex); 192752#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 192750#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 192751#L307 assume !(0 == check_~tmp___3~0 % 256); 191665#L307-1 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; 191666#L151-7 assume 3 == read_history_int8_~history_id; 191731#L152-7 assume !(0 == read_history_int8_~historyIndex); 191732#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 191734#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 191735#L346 assume !(check_~tmp___10~0 > -2); 192016#L346-1 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; 192017#L151-9 assume 3 == read_history_int8_~history_id; 191718#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191719#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 191901#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 191902#L366-1 check_#res := 1; 192849#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 192847#L575-72 assume !(0 == assert_~arg % 256); 192845#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 192843#L550-2 assume !!(main_~i2~0 < 10);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;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; 192841#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; 192838#L570-16 assume 0 != ~gate1Failed~0 % 256; 192836#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 192834#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; 192832#L409 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;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; 192830#L226-2 assume !(0 == write_history_bool_~history_id); 192827#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; 192825#L570-17 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; 192822#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192820#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192818#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192816#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; 192814#L440 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;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; 192812#L226-4 assume !(0 == write_history_bool_~history_id); 192810#L231-4 assume !(1 == write_history_bool_~history_id); 192808#L236-4 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; 192805#L570-18 assume 0 != ~gate3Failed~0 % 256; 192806#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 192945#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; 192942#L471 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; 192940#L486 assume !(~VALUE1~0 == ~VALUE2~0); 192938#L493 assume !(~VALUE1~0 == ~VALUE3~0); 192936#L500 assume !(~VALUE1~0 != ~nomsg~0); 192934#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 192929#L570-19 [2019-01-02 00:14:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1614313294, now seen corresponding path program 1 times [2019-01-02 00:14:17,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:17,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:17,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:17,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-01-02 00:14:17,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:17,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:14:17,418 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:14:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash 828297667, now seen corresponding path program 1 times [2019-01-02 00:14:17,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:17,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:14:17,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:14:17,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:14:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:17,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:14:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:14:18,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:14:18,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2019-01-02 00:14:18,314 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:14:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-02 00:14:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2019-01-02 00:14:18,314 INFO L87 Difference]: Start difference. First operand 1409 states and 1686 transitions. cyclomatic complexity: 288 Second operand 32 states. [2019-01-02 00:14:20,826 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-02 00:14:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:14:21,433 INFO L93 Difference]: Finished difference Result 1946 states and 2311 transitions. [2019-01-02 00:14:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-02 00:14:21,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1946 states and 2311 transitions. [2019-01-02 00:14:21,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2019-01-02 00:14:21,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1946 states to 1140 states and 1350 transitions. [2019-01-02 00:14:21,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2019-01-02 00:14:21,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2019-01-02 00:14:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1140 states and 1350 transitions. [2019-01-02 00:14:21,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:21,450 INFO L705 BuchiCegarLoop]: Abstraction has 1140 states and 1350 transitions. [2019-01-02 00:14:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states and 1350 transitions. [2019-01-02 00:14:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1102. [2019-01-02 00:14:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-01-02 00:14:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1306 transitions. [2019-01-02 00:14:21,460 INFO L728 BuchiCegarLoop]: Abstraction has 1102 states and 1306 transitions. [2019-01-02 00:14:21,460 INFO L608 BuchiCegarLoop]: Abstraction has 1102 states and 1306 transitions. [2019-01-02 00:14:21,460 INFO L442 BuchiCegarLoop]: ======== Iteration 39============ [2019-01-02 00:14:21,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1102 states and 1306 transitions. [2019-01-02 00:14:21,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2019-01-02 00:14:21,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:14:21,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:14:21,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:14:21,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-02 00:14:21,465 INFO L794 eck$LassoCheckResult]: Stem: 195656#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 195406#L-1 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;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;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; 195407#L116-2 assume !!(add_history_type_~var~0 < 3); 195461#L117 assume 0 == add_history_type_~history_id;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; 195462#L171 assume 0 == read_history_bool_~history_id; 195463#L172 assume !(0 == read_history_bool_~historyIndex); 195465#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 196322#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 196320#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 196318#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; 196316#L116-2 assume !!(add_history_type_~var~0 < 3); 196314#L117 assume 0 == add_history_type_~history_id;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; 196312#L171 assume 0 == read_history_bool_~history_id; 196295#L172 assume !(0 == read_history_bool_~historyIndex); 195372#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 195373#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 195587#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 195588#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; 195551#L116-2 assume !!(add_history_type_~var~0 < 3); 195552#L117 assume 0 == add_history_type_~history_id;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; 196324#L171 assume 0 == read_history_bool_~history_id; 196277#L172 assume !(0 == read_history_bool_~historyIndex); 196278#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 196425#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 196424#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 195597#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; 195598#L116-2 assume !(add_history_type_~var~0 < 3); 195545#L116-3 add_history_type_#res := 1; 195546#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 195408#L255 assume !(0 == init_~tmp~1);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; 195409#L116-6 assume !!(add_history_type_~var~0 < 3); 195404#L117-2 assume !(0 == add_history_type_~history_id); 195405#L123-2 assume 1 == add_history_type_~history_id;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; 195549#L171-4 assume !(0 == read_history_bool_~history_id); 195550#L181-4 assume 1 == read_history_bool_~history_id; 195553#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 195554#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 195449#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 195450#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; 195595#L116-6 assume !!(add_history_type_~var~0 < 3); 195596#L117-2 assume !(0 == add_history_type_~history_id); 196099#L123-2 assume 1 == add_history_type_~history_id;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; 196098#L171-4 assume !(0 == read_history_bool_~history_id); 196096#L181-4 assume 1 == read_history_bool_~history_id; 196093#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 196088#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 196086#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 196084#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; 196082#L116-6 assume !!(add_history_type_~var~0 < 3); 195700#L117-2 assume !(0 == add_history_type_~history_id); 196079#L123-2 assume 1 == add_history_type_~history_id;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; 196077#L171-4 assume !(0 == read_history_bool_~history_id); 195775#L181-4 assume 1 == read_history_bool_~history_id; 195772#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 195711#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 195707#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 195702#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; 195699#L116-6 assume !(add_history_type_~var~0 < 3); 195589#L116-7 add_history_type_#res := 1; 195590#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 195614#L259 assume !(0 == init_~tmp___0~1);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; 195577#L116-10 assume !!(add_history_type_~var~0 < 3); 195394#L117-4 assume !(0 == add_history_type_~history_id); 195395#L123-4 assume !(1 == add_history_type_~history_id); 195645#L129-4 assume 2 == add_history_type_~history_id;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; 195593#L171-8 assume !(0 == read_history_bool_~history_id); 195594#L181-8 assume !(1 == read_history_bool_~history_id); 195468#L191-8 assume 2 == read_history_bool_~history_id; 195469#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 195628#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 195429#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 195430#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; 195578#L116-10 assume !!(add_history_type_~var~0 < 3); 195396#L117-4 assume !(0 == add_history_type_~history_id); 195397#L123-4 assume !(1 == add_history_type_~history_id); 196115#L129-4 assume 2 == add_history_type_~history_id;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; 196113#L171-8 assume !(0 == read_history_bool_~history_id); 196111#L181-8 assume !(1 == read_history_bool_~history_id); 196109#L191-8 assume 2 == read_history_bool_~history_id; 196105#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 196103#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 196102#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 195769#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; 195709#L116-10 assume !!(add_history_type_~var~0 < 3); 195704#L117-4 assume !(0 == add_history_type_~history_id); 195695#L123-4 assume !(1 == add_history_type_~history_id); 195644#L129-4 assume 2 == add_history_type_~history_id;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; 195591#L171-8 assume !(0 == read_history_bool_~history_id); 195592#L181-8 assume !(1 == read_history_bool_~history_id); 195466#L191-8 assume 2 == read_history_bool_~history_id; 195467#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 195626#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 195427#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 195428#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; 195607#L116-10 assume !(add_history_type_~var~0 < 3); 195513#L116-11 add_history_type_#res := 1; 195514#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 195398#L263 assume !(0 == init_~tmp___1~1);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; 195399#L116-14 assume !!(add_history_type_~var~0 < 3); 195374#L117-6 assume !(0 == add_history_type_~history_id); 195375#L123-6 assume !(1 == add_history_type_~history_id); 195785#L129-6 assume !(2 == add_history_type_~history_id); 195783#L135-9 assume 3 == add_history_type_~history_id;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; 195781#L151-3 assume 3 == read_history_int8_~history_id; 195779#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195777#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 195669#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 195548#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; 195485#L116-14 assume !!(add_history_type_~var~0 < 3); 195376#L117-6 assume !(0 == add_history_type_~history_id); 195377#L123-6 assume !(1 == add_history_type_~history_id); 195630#L129-6 assume !(2 == add_history_type_~history_id); 195631#L135-9 assume 3 == add_history_type_~history_id;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; 196143#L151-3 assume 3 == read_history_int8_~history_id; 196141#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 196139#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 196137#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 196135#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; 196133#L116-14 assume !!(add_history_type_~var~0 < 3); 195701#L117-6 assume !(0 == add_history_type_~history_id); 195694#L123-6 assume !(1 == add_history_type_~history_id); 195629#L129-6 assume !(2 == add_history_type_~history_id); 195564#L135-9 assume 3 == add_history_type_~history_id;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; 195565#L151-3 assume 3 == read_history_int8_~history_id; 195579#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195580#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 195583#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 195547#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; 195484#L116-14 assume !(add_history_type_~var~0 < 3); 195482#L116-15 add_history_type_#res := 1; 195483#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 196114#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 196112#L270 main_#t~ret57 := init_#res;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; 196110#L550-2 assume !!(main_~i2~0 < 10);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;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; 195908#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; 195906#L570-16 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; 195671#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 195615#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 195543#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; 195544#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; 195378#L409 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;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; 195379#L226-2 assume !(0 == write_history_bool_~history_id); 195608#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; 195519#L570-17 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; 195520#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 195541#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 195445#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 195446#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; 195455#L440 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;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; 195560#L226-4 assume !(0 == write_history_bool_~history_id); 195561#L231-4 assume !(1 == write_history_bool_~history_id); 195664#L236-4 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; 195523#L570-18 assume 0 != ~gate3Failed~0 % 256; 195525#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 196415#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; 196414#L471 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; 196413#L486 assume ~VALUE1~0 == ~VALUE2~0; 196412#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 196411#L570-19 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; 196409#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; 195533#L570-20 ~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;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; 195534#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 195652#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 196408#L171-12 assume 0 == read_history_bool_~history_id; 196407#L172-12 assume !(0 == read_history_bool_~historyIndex); 196405#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 195676#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 195677#L307 assume !(0 == check_~tmp___3~0 % 256); 195768#L307-1 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; 195766#L151-7 assume 3 == read_history_int8_~history_id; 195765#L152-7 assume !(0 == read_history_int8_~historyIndex); 195763#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 195762#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 195761#L346 assume !(check_~tmp___10~0 > -2); 195760#L346-1 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; 195758#L151-9 assume 3 == read_history_int8_~history_id; 195756#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195754#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 195752#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 195750#L366-1 check_#res := 1; 195748#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 195747#L575-72 assume !(0 == assert_~arg % 256); 195745#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 195743#L550-2 assume !!(main_~i2~0 < 10);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;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; 195741#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; 195739#L570-16 assume 0 != ~gate1Failed~0 % 256; 195736#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 195737#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; 196020#L409 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;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; 196018#L226-2 assume !(0 == write_history_bool_~history_id); 196014#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; 196012#L570-17 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; 196010#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 196008#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 196006#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 196004#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; 196002#L440 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;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; 196000#L226-4 assume !(0 == write_history_bool_~history_id); 195998#L231-4 assume !(1 == write_history_bool_~history_id); 195996#L236-4 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; 195994#L570-18 assume 0 != ~gate3Failed~0 % 256; 195439#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 195386#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; 195387#L471 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; 195433#L486 assume !(~VALUE1~0 == ~VALUE2~0); 195434#L493 assume !(~VALUE1~0 == ~VALUE3~0); 195692#L500 assume !(~VALUE1~0 != ~nomsg~0); 195686#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 195680#L570-19 [2019-01-02 00:14:21,465 INFO L796 eck$LassoCheckResult]: Loop: 195680#L570-19 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; 195885#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; 195883#L570-20 ~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;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; 195881#L294 assume !(0 == ~gate1Failed~0 % 256); 195873#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 195874#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 196468#L171-12 assume 0 == read_history_bool_~history_id; 196467#L172-12 assume !(0 == read_history_bool_~historyIndex); 196466#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 196465#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 196066#L307 assume !(0 == check_~tmp___3~0 % 256); 195423#L307-1 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; 195424#L151-7 assume 3 == read_history_int8_~history_id; 195486#L152-7 assume !(0 == read_history_int8_~historyIndex); 195457#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 195458#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 195488#L346 assume !(check_~tmp___10~0 > -2); 195683#L346-1 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; 195666#L151-9 assume 3 == read_history_int8_~history_id; 195476#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195477#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 195480#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 195620#L366-1 check_#res := 1; 195537#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 195538#L575-72 assume !(0 == assert_~arg % 256); 195451#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 195452#L550-2 assume !!(main_~i2~0 < 10);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;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; 195612#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; 195568#L570-16 assume 0 != ~gate1Failed~0 % 256; 195569#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 195610#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; 195616#L409 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;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; 196384#L226-2 assume !(0 == write_history_bool_~history_id); 196382#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; 196381#L570-17 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; 196380#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 196379#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 196378#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 196377#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; 196376#L440 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;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; 196375#L226-4 assume !(0 == write_history_bool_~history_id); 196374#L231-4 assume !(1 == write_history_bool_~history_id); 196373#L236-4 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; 196372#L570-18 assume !(0 != ~gate3Failed~0 % 256);gate3_each_pals_period_~tmp~5 := gate3_each_pals_period_#t~nondet37;havoc gate3_each_pals_period_#t~nondet37;gate3_each_pals_period_~next_state~2 := gate3_each_pals_period_~tmp~5; 195507#L458 assume 0 == gate3_each_pals_period_~next_state~2;gate3_each_pals_period_~tmp___0~5 := 1; 195382#L464-2 assume 0 != (if 0 == gate3_each_pals_period_~tmp___0~5 then 0 else 1) % 256; 195383#L470 assume gate3_each_pals_period_~next_state~2 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0;gate3_each_pals_period_#t~ite38 := gate3_each_pals_period_~next_state~2; 195672#L470-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite38 % 256 <= 127 then gate3_each_pals_period_#t~ite38 % 256 else gate3_each_pals_period_#t~ite38 % 256 - 256);havoc gate3_each_pals_period_#t~ite38; 195673#L471 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; 196357#L486 assume ~VALUE1~0 == ~VALUE2~0; 195945#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 196354#L570-19 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; 196352#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; 196350#L570-20 ~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;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; 196348#L294 assume !(0 == ~gate1Failed~0 % 256); 196346#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 195655#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 195575#L171-12 assume 0 == read_history_bool_~history_id; 195414#L172-12 assume !(0 == read_history_bool_~historyIndex); 195415#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 195696#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 195418#L307 assume !(0 == check_~tmp___3~0 % 256); 195419#L307-1 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; 196021#L151-7 assume 3 == read_history_int8_~history_id; 196019#L152-7 assume !(0 == read_history_int8_~historyIndex); 196017#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 196016#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 196013#L346 assume !(check_~tmp___10~0 > -2); 196011#L346-1 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; 196009#L151-9 assume 3 == read_history_int8_~history_id; 196007#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 196005#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 196003#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 196001#L366-1 check_#res := 1; 195999#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 195997#L575-72 assume !(0 == assert_~arg % 256); 195995#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 195993#L550-2 assume !!(main_~i2~0 < 10);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;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; 195992#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; 195991#L570-16 assume 0 != ~gate1Failed~0 % 256; 195987#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 195985#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; 195983#L409 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;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; 195981#L226-2 assume !(0 == write_history_bool_~history_id); 195977#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; 195975#L570-17 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; 195973#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 195972#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 195971#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 195970#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; 195969#L440 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;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; 195968#L226-4 assume !(0 == write_history_bool_~history_id); 195967#L231-4 assume !(1 == write_history_bool_~history_id); 195966#L236-4 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; 195964#L570-18 assume 0 != ~gate3Failed~0 % 256; 195965#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 196428#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; 196427#L471 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; 196426#L486 assume !(~VALUE1~0 == ~VALUE2~0); 195603#L493 assume !(~VALUE1~0 == ~VALUE3~0); 195604#L500 assume !(~VALUE1~0 != ~nomsg~0); 196430#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 195680#L570-19 [2019-01-02 00:14:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:21,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1614313294, now seen corresponding path program 2 times [2019-01-02 00:14:21,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:21,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:21,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:21,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:21,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-01-02 00:14:21,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:21,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:14:21,557 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:14:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1286971995, now seen corresponding path program 1 times [2019-01-02 00:14:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:21,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:14:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:14:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:14:25,252 WARN L181 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 503 DAG size of output: 419 [2019-01-02 00:14:25,253 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:14:29,228 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 212 DAG size of output: 169 [2019-01-02 00:14:29,235 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:14:29,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:14:29,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:14:29,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:14:29,235 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:14:29,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:29,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:14:29,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:14:29,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration39_Loop [2019-01-02 00:14:29,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:14:29,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:14:29,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14: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 [2019-01-02 00:14:29,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14: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 [2019-01-02 00:14: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 [2019-01-02 00:14:29,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:29,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:30,712 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-01-02 00:14:30,986 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-02 00:14:31,433 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-02 00:14:31,620 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:14:31,621 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,633 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 301 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,645 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_35=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_35=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,671 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 302 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,683 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,683 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,708 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 303 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,718 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,718 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,744 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 304 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,757 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,784 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 305 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,797 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,825 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 306 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,837 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_35=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_35=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,865 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 307 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,893 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,893 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_35=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,901 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 308 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,913 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,946 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 309 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,957 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,957 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:31,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:31,986 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 310 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:31,999 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:31,999 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___0~2=0} Honda state: {ULTIMATE.start_check_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,030 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 311 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_35=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_35=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,065 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 312 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,076 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,105 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 313 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,120 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,121 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed_History_1~0=128} Honda state: {~gate1Failed_History_1~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,147 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 314 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,158 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,158 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,188 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 315 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,200 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,223 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 316 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,234 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,259 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 317 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,271 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,271 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,298 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 318 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,311 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret11=0} Honda state: {ULTIMATE.start_check_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,339 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 319 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,351 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,383 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 320 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,395 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,425 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 321 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,435 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,461 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 322 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,472 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,497 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 323 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,535 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 324 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,550 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,582 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 325 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,636 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,659 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 326 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,670 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,698 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 327 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,710 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,738 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 328 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,750 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,750 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,782 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 329 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,809 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,809 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_35=3} Honda state: {v_rep#funAddr~voter.offset_35=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,816 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 330 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,827 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,827 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,858 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 331 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,869 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:14:32,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,913 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,940 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 333 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,953 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:32,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:32,984 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 334 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:32,996 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:32,996 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:33,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:33,022 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 335 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:33,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:33,036 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:33,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:33,063 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 336 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:33,078 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:33,078 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:33,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:33,105 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 337 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:33,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:14:33,118 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed_History_1~0=-256} Honda state: {~gate2Failed_History_1~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:33,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:14:33,146 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 338 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:14:33,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:14:33,198 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 339 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:45,498 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:14:45,511 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:14:45,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:14:45,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:14:45,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:14:45,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:14:45,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:45,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:14:45,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:14:45,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration39_Loop [2019-01-02 00:14:45,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:14:45,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:14:45,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:45,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:46,924 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-01-02 00:14:47,204 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-02 00:14:47,600 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-02 00:14:47,808 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:14:47,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:14:47,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:47,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:47,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:47,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:47,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,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 [2019-01-02 00:14:47,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,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 [2019-01-02 00:14:47,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:47,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:47,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,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 [2019-01-02 00:14:47,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,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 [2019-01-02 00:14:47,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,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 [2019-01-02 00:14:47,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:14:47,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:14:47,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:14:47,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:14:47,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 [2019-01-02 00:14:47,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:14:47,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:14:47,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:14:47,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:14:47,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:14:47,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:14:47,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:14:47,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:14:47,905 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:14:47,905 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:14:47,906 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:14:47,906 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:14:47,906 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:14:47,906 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_voter_~voted_value~0) = -1*ULTIMATE.start_voter_~voted_value~0 Supporting invariants [] [2019-01-02 00:14:47,906 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:14:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:48,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:14:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:48,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:14:49,599 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-02 00:14:49,940 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-02 00:14:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:14:50,388 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 16 loop predicates [2019-01-02 00:14:50,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1102 states and 1306 transitions. cyclomatic complexity: 214 Second operand 17 states. [2019-01-02 00:14:51,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1102 states and 1306 transitions. cyclomatic complexity: 214. Second operand 17 states. Result 2710 states and 3200 transitions. Complement of second has 42 states. [2019-01-02 00:14:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2019-01-02 00:14:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:14:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 643 transitions. [2019-01-02 00:14:51,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 643 transitions. Stem has 208 letters. Loop has 102 letters. [2019-01-02 00:14:51,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:14:51,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 643 transitions. Stem has 310 letters. Loop has 102 letters. [2019-01-02 00:14:51,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:14:51,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 643 transitions. Stem has 208 letters. Loop has 204 letters. [2019-01-02 00:14:51,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:14:51,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2710 states and 3200 transitions. [2019-01-02 00:14:51,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2019-01-02 00:14:51,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2710 states to 2086 states and 2468 transitions. [2019-01-02 00:14:51,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1216 [2019-01-02 00:14:51,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1218 [2019-01-02 00:14:51,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2086 states and 2468 transitions. [2019-01-02 00:14:51,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:51,987 INFO L705 BuchiCegarLoop]: Abstraction has 2086 states and 2468 transitions. [2019-01-02 00:14:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states and 2468 transitions. [2019-01-02 00:14:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1620. [2019-01-02 00:14:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2019-01-02 00:14:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1923 transitions. [2019-01-02 00:14:52,002 INFO L728 BuchiCegarLoop]: Abstraction has 1620 states and 1923 transitions. [2019-01-02 00:14:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:14:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:14:52,002 INFO L87 Difference]: Start difference. First operand 1620 states and 1923 transitions. Second operand 3 states. [2019-01-02 00:14:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:14:52,176 INFO L93 Difference]: Finished difference Result 1412 states and 1651 transitions. [2019-01-02 00:14:52,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:14:52,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1412 states and 1651 transitions. [2019-01-02 00:14:52,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2019-01-02 00:14:52,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1412 states to 1412 states and 1651 transitions. [2019-01-02 00:14:52,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2019-01-02 00:14:52,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2019-01-02 00:14:52,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1412 states and 1651 transitions. [2019-01-02 00:14:52,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:14:52,188 INFO L705 BuchiCegarLoop]: Abstraction has 1412 states and 1651 transitions. [2019-01-02 00:14:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states and 1651 transitions. [2019-01-02 00:14:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-01-02 00:14:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-01-02 00:14:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1651 transitions. [2019-01-02 00:14:52,199 INFO L728 BuchiCegarLoop]: Abstraction has 1412 states and 1651 transitions. [2019-01-02 00:14:52,199 INFO L608 BuchiCegarLoop]: Abstraction has 1412 states and 1651 transitions. [2019-01-02 00:14:52,200 INFO L442 BuchiCegarLoop]: ======== Iteration 40============ [2019-01-02 00:14:52,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1412 states and 1651 transitions. [2019-01-02 00:14:52,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2019-01-02 00:14:52,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:14:52,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:14:52,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:14:52,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] [2019-01-02 00:14:52,205 INFO L794 eck$LassoCheckResult]: Stem: 203542#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~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]; 203282#L-1 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;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;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; 203283#L116-2 assume !!(add_history_type_~var~0 < 3); 203431#L117 assume 0 == add_history_type_~history_id;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; 203489#L171 assume 0 == read_history_bool_~history_id; 203490#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 203584#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 203585#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 203475#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; 203432#L116-2 assume !!(add_history_type_~var~0 < 3); 203339#L117 assume 0 == add_history_type_~history_id;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; 203340#L171 assume 0 == read_history_bool_~history_id; 203341#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 203342#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 203465#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 203466#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; 203635#L116-2 assume !!(add_history_type_~var~0 < 3); 203620#L117 assume 0 == add_history_type_~history_id;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; 203632#L171 assume 0 == read_history_bool_~history_id; 203630#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 203628#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 203625#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 203624#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; 203619#L116-2 assume !(add_history_type_~var~0 < 3); 203425#L116-3 add_history_type_#res := 1; 203426#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 203284#L255 assume !(0 == init_~tmp~1);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; 203285#L116-6 assume !!(add_history_type_~var~0 < 3); 203280#L117-2 assume !(0 == add_history_type_~history_id); 203281#L123-2 assume 1 == add_history_type_~history_id;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; 203429#L171-4 assume !(0 == read_history_bool_~history_id); 203430#L181-4 assume 1 == read_history_bool_~history_id; 203556#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 203631#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 203629#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 203627#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; 203473#L116-6 assume !!(add_history_type_~var~0 < 3); 203474#L117-2 assume !(0 == add_history_type_~history_id); 203589#L123-2 assume 1 == add_history_type_~history_id;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; 203590#L171-4 assume !(0 == read_history_bool_~history_id); 203634#L181-4 assume 1 == read_history_bool_~history_id; 203433#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 203434#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 203327#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 203328#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; 203497#L116-6 assume !!(add_history_type_~var~0 < 3); 203592#L117-2 assume !(0 == add_history_type_~history_id); 203617#L123-2 assume 1 == add_history_type_~history_id;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; 203614#L171-4 assume !(0 == read_history_bool_~history_id); 203611#L181-4 assume 1 == read_history_bool_~history_id; 203607#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 203603#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 203600#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 203597#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; 203591#L116-6 assume !(add_history_type_~var~0 < 3); 203467#L116-7 add_history_type_#res := 1; 203468#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 203498#L259 assume !(0 == init_~tmp___0~1);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; 203499#L116-10 assume !!(add_history_type_~var~0 < 3); 203270#L117-4 assume !(0 == add_history_type_~history_id); 203271#L123-4 assume !(1 == add_history_type_~history_id); 203626#L129-4 assume 2 == add_history_type_~history_id;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; 203471#L171-8 assume !(0 == read_history_bool_~history_id); 203472#L181-8 assume !(1 == read_history_bool_~history_id); 203345#L191-8 assume 2 == read_history_bool_~history_id; 203346#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 203570#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 203306#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 203307#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; 203456#L116-10 assume !!(add_history_type_~var~0 < 3); 203272#L117-4 assume !(0 == add_history_type_~history_id); 203273#L123-4 assume !(1 == add_history_type_~history_id); 203529#L129-4 assume 2 == add_history_type_~history_id;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; 203530#L171-8 assume !(0 == read_history_bool_~history_id); 203616#L181-8 assume !(1 == read_history_bool_~history_id); 203613#L191-8 assume 2 == read_history_bool_~history_id; 203609#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 203605#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 203602#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 203599#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; 203596#L116-10 assume !!(add_history_type_~var~0 < 3); 203594#L117-4 assume !(0 == add_history_type_~history_id); 203586#L123-4 assume !(1 == add_history_type_~history_id); 203528#L129-4 assume 2 == add_history_type_~history_id;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; 203469#L171-8 assume !(0 == read_history_bool_~history_id); 203470#L181-8 assume !(1 == read_history_bool_~history_id); 203343#L191-8 assume 2 == read_history_bool_~history_id; 203344#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 203569#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 203304#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 203305#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; 203455#L116-10 assume !(add_history_type_~var~0 < 3); 203392#L116-11 add_history_type_#res := 1; 203393#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 203274#L263 assume !(0 == init_~tmp___1~1);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; 203275#L116-14 assume !!(add_history_type_~var~0 < 3); 203250#L117-6 assume !(0 == add_history_type_~history_id); 203251#L123-6 assume !(1 == add_history_type_~history_id); 203514#L129-6 assume !(2 == add_history_type_~history_id); 203445#L135-9 assume 3 == add_history_type_~history_id;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; 203446#L151-3 assume 3 == read_history_int8_~history_id; 203459#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203460#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 203462#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 203428#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; 203363#L116-14 assume !!(add_history_type_~var~0 < 3); 203252#L117-6 assume !(0 == add_history_type_~history_id); 203253#L123-6 assume !(1 == add_history_type_~history_id); 203618#L129-6 assume !(2 == add_history_type_~history_id); 203615#L135-9 assume 3 == add_history_type_~history_id;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; 203612#L151-3 assume 3 == read_history_int8_~history_id; 203608#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203604#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 203601#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 203598#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; 203595#L116-14 assume !!(add_history_type_~var~0 < 3); 203593#L117-6 assume !(0 == add_history_type_~history_id); 203583#L123-6 assume !(1 == add_history_type_~history_id); 203513#L129-6 assume !(2 == add_history_type_~history_id); 203443#L135-9 assume 3 == add_history_type_~history_id;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; 203444#L151-3 assume 3 == read_history_int8_~history_id; 203457#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203458#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 203461#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 203427#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; 203362#L116-14 assume !(add_history_type_~var~0 < 3); 203360#L116-15 add_history_type_#res := 1; 203361#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 203543#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 203502#L270 main_#t~ret57 := init_#res;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; 203503#L550-2 assume !!(main_~i2~0 < 10);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;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; 203622#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; 203621#L570-16 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; 203558#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 203500#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 203423#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; 203424#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; 203435#L409 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;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; 203841#L226-2 assume !(0 == write_history_bool_~history_id); 203838#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; 203836#L570-17 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; 203834#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 203818#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 203793#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 203790#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; 203788#L440 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;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; 203785#L226-4 assume !(0 == write_history_bool_~history_id); 203782#L231-4 assume !(1 == write_history_bool_~history_id); 203780#L236-4 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; 203777#L570-18 assume 0 != ~gate3Failed~0 % 256; 203776#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 203774#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; 203769#L471 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; 203770#L486 assume ~VALUE1~0 == ~VALUE2~0; 203764#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 203765#L570-19 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; 203760#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; 203758#L570-20 ~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;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; 203755#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 203751#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 203749#L171-12 assume 0 == read_history_bool_~history_id; 203747#L172-12 assume !(0 == read_history_bool_~historyIndex); 203745#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 203743#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 203741#L307 assume 0 == check_~tmp___3~0 % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 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; 203740#L171-13 assume !(0 == read_history_bool_~history_id); 203738#L181-13 assume 1 == read_history_bool_~history_id; 203736#L182-13 assume !(0 == read_history_bool_~historyIndex); 203730#L185-13 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_1~0; 203724#L203-13 check_#t~ret10 := read_history_bool_#res;check_~tmp___4~0 := check_#t~ret10;havoc check_#t~ret10; 203711#L309 assume !(0 == check_~tmp___4~0 % 256); 203709#L307-1 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; 203707#L151-7 assume 3 == read_history_int8_~history_id; 203705#L152-7 assume !(0 == read_history_int8_~historyIndex); 203703#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 203701#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 203699#L346 assume !(check_~tmp___10~0 > -2); 203697#L346-1 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; 203695#L151-9 assume 3 == read_history_int8_~history_id; 203693#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203691#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 203689#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 203686#L366-1 check_#res := 1; 203684#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 203682#L575-72 assume !(0 == assert_~arg % 256); 203680#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 203678#L550-2 assume !!(main_~i2~0 < 10);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;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; 203676#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; 203674#L570-16 assume 0 != ~gate1Failed~0 % 256; 203671#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 203672#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; 204184#L409 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;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; 204181#L226-2 assume !(0 == write_history_bool_~history_id); 204177#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; 204173#L570-17 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; 204169#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 204165#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 204161#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 204157#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; 204152#L440 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;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; 204148#L226-4 assume !(0 == write_history_bool_~history_id); 204144#L231-4 assume !(1 == write_history_bool_~history_id); 204140#L236-4 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; 204135#L570-18 assume 0 != ~gate3Failed~0 % 256; 204136#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 204253#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; 204250#L471 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; 204248#L486 assume !(~VALUE1~0 == ~VALUE2~0); 203480#L493 assume !(~VALUE1~0 == ~VALUE3~0); 203481#L500 assume !(~VALUE1~0 != ~nomsg~0); 203577#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 203578#L570-19 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; 203410#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; 204597#L570-20 ~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;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; 204594#L294 assume !(0 == ~gate1Failed~0 % 256); 204591#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 204587#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 204584#L171-12 assume 0 == read_history_bool_~history_id; 204581#L172-12 assume !(0 == read_history_bool_~historyIndex); 204578#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 204575#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 204515#L307 assume !(0 == check_~tmp___3~0 % 256); 204511#L307-1 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; 204509#L151-7 assume 3 == read_history_int8_~history_id; 204507#L152-7 assume !(0 == read_history_int8_~historyIndex); 204506#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 204505#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 204504#L346 assume !(check_~tmp___10~0 > -2); 204503#L346-1 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; 204502#L151-9 assume 3 == read_history_int8_~history_id; 204501#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 204500#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 204499#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 204498#L366-1 check_#res := 1; 204497#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 204496#L575-72 assume !(0 == assert_~arg % 256); 204495#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 204494#L550-2 assume !!(main_~i2~0 < 10);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;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; 204493#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; 204492#L570-16 assume 0 != ~gate1Failed~0 % 256; 204491#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 204490#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; 204489#L409 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;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; 204488#L226-2 assume !(0 == write_history_bool_~history_id); 204486#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; 204485#L570-17 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; 204484#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 204483#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 204482#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 204481#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; 204480#L440 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;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; 204479#L226-4 assume !(0 == write_history_bool_~history_id); 204478#L231-4 assume !(1 == write_history_bool_~history_id); 204477#L236-4 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; 204476#L570-18 assume 0 != ~gate3Failed~0 % 256; 204317#L453 [2019-01-02 00:14:52,205 INFO L796 eck$LassoCheckResult]: Loop: 204317#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 204316#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; 203483#L471 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; 203310#L486 assume ~VALUE1~0 == ~VALUE2~0; 203311#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 203406#L570-19 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; 203407#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; 203413#L570-20 ~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;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; 203414#L294 assume !(0 == ~gate1Failed~0 % 256); 203537#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 203538#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 203451#L171-12 assume 0 == read_history_bool_~history_id; 203290#L172-12 assume !(0 == read_history_bool_~historyIndex); 203291#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 203562#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 203563#L307 assume !(0 == check_~tmp___3~0 % 256); 203300#L307-1 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; 203301#L151-7 assume 3 == read_history_int8_~history_id; 203364#L152-7 assume !(0 == read_history_int8_~historyIndex); 203365#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 204382#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 204381#L346 assume !(check_~tmp___10~0 > -2); 204380#L346-1 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; 204379#L151-9 assume 3 == read_history_int8_~history_id; 203353#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203354#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 203504#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 203505#L366-1 check_#res := 1; 204366#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 204365#L575-72 assume !(0 == assert_~arg % 256); 204364#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 204363#L550-2 assume !!(main_~i2~0 < 10);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;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; 203494#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; 203495#L570-16 assume 0 != ~gate1Failed~0 % 256; 203491#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 203492#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; 204350#L409 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;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; 204349#L226-2 assume !(0 == write_history_bool_~history_id); 203507#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; 203508#L570-17 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; 203485#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 203486#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 204339#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 204338#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; 204337#L440 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;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; 204336#L226-4 assume !(0 == write_history_bool_~history_id); 204335#L231-4 assume !(1 == write_history_bool_~history_id); 204333#L236-4 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; 204318#L570-18 assume 0 != ~gate3Failed~0 % 256; 204317#L453 [2019-01-02 00:14:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash -834366997, now seen corresponding path program 1 times [2019-01-02 00:14:52,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:52,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:52,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:14:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-01-02 00:14:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:14:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-02 00:14:52,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:14:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:14:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash -828883181, now seen corresponding path program 5 times [2019-01-02 00:14:52,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:14:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:14:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:52,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:14:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:14:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:14:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:14:53,606 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 259 DAG size of output: 226 [2019-01-02 00:14:56,719 WARN L181 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2019-01-02 00:14:56,728 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:14:56,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:14:56,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:14:56,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:14:56,728 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:14:56,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:14:56,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:14:56,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:14:56,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration40_Loop [2019-01-02 00:14:56,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:14:56,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:14:56,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:56,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,085 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-02 00:14:57,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:14:57,947 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-02 00:14:58,205 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:15:02,158 WARN L181 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2019-01-02 00:15:02,375 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:15:02,376 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:15:02,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,399 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_37=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_37=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,427 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 341 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,439 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,465 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 342 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,481 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,482 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Honda state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,509 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 343 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,520 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,549 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 344 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,561 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,561 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,593 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 345 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,620 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_37=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,627 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 346 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,637 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,637 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,670 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 347 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,681 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,681 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_37=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_37=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,710 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 348 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,723 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:15:02,723 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:02,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:15:02,770 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-02 00:15:02,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:15:02,933 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 350 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:15,323 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-02 00:15:15,341 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:15:15,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:15:15,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:15:15,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:15:15,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:15:15,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:15,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:15:15,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:15:15,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration40_Loop [2019-01-02 00:15:15,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:15:15,342 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:15:15,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:15,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,177 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-02 00:15:16,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:16,580 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:15:16,809 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-02 00:15:17,142 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-02 00:15:21,200 WARN L181 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2019-01-02 00:15:21,267 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:15:21,267 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:15:21,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:21,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:21,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,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 [2019-01-02 00:15:21,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:21,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:21,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:21,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:21,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,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 [2019-01-02 00:15:21,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:21,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:21,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:21,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:21,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:21,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:21,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:21,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:21,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:21,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:15:21,351 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:15:21,355 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:15:21,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:15:21,355 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:15:21,355 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:15:21,355 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2019-01-02 00:15:21,356 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:15:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:15:21,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:15:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:15:21,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:15:22,390 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-02 00:15:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:15:22,404 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 [2019-01-02 00:15:22,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1412 states and 1651 transitions. cyclomatic complexity: 246 Second operand 5 states. [2019-01-02 00:15:22,698 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1412 states and 1651 transitions. cyclomatic complexity: 246. Second operand 5 states. Result 4039 states and 4773 transitions. Complement of second has 6 states. [2019-01-02 00:15:22,702 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 [2019-01-02 00:15:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:15:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2019-01-02 00:15:22,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 295 transitions. Stem has 255 letters. Loop has 49 letters. [2019-01-02 00:15:22,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:15:22,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 295 transitions. Stem has 304 letters. Loop has 49 letters. [2019-01-02 00:15:22,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:15:22,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 295 transitions. Stem has 255 letters. Loop has 98 letters. [2019-01-02 00:15:22,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:15:22,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4039 states and 4773 transitions. [2019-01-02 00:15:22,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2019-01-02 00:15:22,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4039 states to 1030 states and 1201 transitions. [2019-01-02 00:15:22,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2019-01-02 00:15:22,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2019-01-02 00:15:22,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1030 states and 1201 transitions. [2019-01-02 00:15:22,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:15:22,741 INFO L705 BuchiCegarLoop]: Abstraction has 1030 states and 1201 transitions. [2019-01-02 00:15:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states and 1201 transitions. [2019-01-02 00:15:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2019-01-02 00:15:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2019-01-02 00:15:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1201 transitions. [2019-01-02 00:15:22,766 INFO L728 BuchiCegarLoop]: Abstraction has 1030 states and 1201 transitions. [2019-01-02 00:15:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-02 00:15:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-02 00:15:22,766 INFO L87 Difference]: Start difference. First operand 1030 states and 1201 transitions. Second operand 9 states. [2019-01-02 00:15:23,984 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-02 00:15:24,230 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-02 00:15:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:15:24,425 INFO L93 Difference]: Finished difference Result 508 states and 574 transitions. [2019-01-02 00:15:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-02 00:15:24,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 574 transitions. [2019-01-02 00:15:24,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:15:24,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 0 states and 0 transitions. [2019-01-02 00:15:24,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:15:24,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:15:24,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:15:24,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:15:24,429 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:15:24,429 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:15:24,429 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:15:24,429 INFO L442 BuchiCegarLoop]: ======== Iteration 41============ [2019-01-02 00:15:24,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:15:24,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:15:24,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:15:24,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:15:24 BoogieIcfgContainer [2019-01-02 00:15:24,441 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:15:24,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:15:24,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:15:24,441 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:15:24,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:06:16" (3/4) ... [2019-01-02 00:15:24,448 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:15:24,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:15:24,449 INFO L168 Benchmark]: Toolchain (without parser) took 552010.59 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 678.4 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -382.5 MB). Peak memory consumption was 295.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:15:24,449 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:15:24,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:15:24,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 180.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:15:24,450 INFO L168 Benchmark]: Boogie Preprocessor took 111.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:15:24,450 INFO L168 Benchmark]: RCFGBuilder took 3221.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 138.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:15:24,451 INFO L168 Benchmark]: BuchiAutomizer took 547926.12 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 540.0 MB). Free memory was 980.1 MB in the beginning and 1.3 GB in the end (delta: -349.8 MB). Peak memory consumption was 190.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:15:24,451 INFO L168 Benchmark]: Witness Printer took 6.84 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:15:24,453 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 180.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3221.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 138.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 547926.12 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 540.0 MB). Free memory was 980.1 MB in the beginning and 1.3 GB in the end (delta: -349.8 MB). Peak memory consumption was 190.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.84 ms. Allocated memory is still 1.7 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 59 terminating modules (40 trivial, 19 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 -1 * votedValue_History_0 + -1 * g2v_\old + nomsg and consists of 21 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 -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 nomsg + -1 * \result + -1 * g2v_\old and consists of 21 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 * voted_value and consists of 22 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. 40 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 547.8s and 41 iterations. TraceHistogramMax:3. Analysis of lassos took 492.3s. Construction of modules took 19.8s. Büchi inclusion checks took 32.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 58. Automata minimization 1.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 28372 StatesRemovedByMinimization, 40 NontrivialMinimizations. Non-live state removal took 1.0s Buchi closure took 0.0s. Biggest automaton had 3535 states and ocurred in iteration 35. Nontrivial modules had stage [19, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/46 HoareTripleCheckerStatistics: 31269 SDtfs, 37571 SDslu, 64340 SDs, 0 SdLazy, 9805 SolverSat, 870 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI21 SILT18 lasso0 LassoPreprocessingBenchmarks: Lassos: inital726 mio100 ax144 hnf105 lsp22 ukn74 mio100 lsp100 div159 bol100 ite100 ukn100 eq174 hnf74 smp99 dnf3923 smp20 tf102 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 202ms VariablesStem: 0 VariablesLoop: 31 DisjunctsStem: 1 DisjunctsLoop: 24 SupportingInvariants: 0 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 303 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 11 LassoNonterminationAnalysisTime: 147.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...