./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:36:48,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:36:48,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:36:48,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:36:48,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:36:48,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:36:48,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:36:48,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:36:48,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:36:48,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:36:48,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:36:48,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:36:48,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:36:48,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:36:48,681 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:36:48,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:36:48,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:36:48,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:36:48,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:36:48,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:36:48,686 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:36:48,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:36:48,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:36:48,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:36:48,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:36:48,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:36:48,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:36:48,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:36:48,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:36:48,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:36:48,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:36:48,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:36:48,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:36:48,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:36:48,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:36:48,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:36:48,697 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 12:36:48,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:36:48,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:36:48,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:36:48,707 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 12:36:48,708 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:36:48,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:36:48,708 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:36:48,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:36:48,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:36:48,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:36:48,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:36:48,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:36:48,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:36:48,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:36:48,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:36:48,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:36:48,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:36:48,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:36:48,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:36:48,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:36:48,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:36:48,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:36:48,711 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) 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 -> 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c [2018-11-18 12:36:48,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:36:48,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:36:48,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:36:48,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:36:48,752 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:36:48,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 12:36:48,800 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/data/535431e5e/e15574a382a741f98813d3d9db6e0780/FLAG4da6b9b19 [2018-11-18 12:36:49,203 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:36:49,203 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 12:36:49,212 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/data/535431e5e/e15574a382a741f98813d3d9db6e0780/FLAG4da6b9b19 [2018-11-18 12:36:49,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/data/535431e5e/e15574a382a741f98813d3d9db6e0780 [2018-11-18 12:36:49,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:36:49,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:36:49,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:36:49,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:36:49,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:36:49,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:49,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52300dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49, skipping insertion in model container [2018-11-18 12:36:49,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:49,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:36:49,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:36:49,838 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:36:49,849 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:36:49,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:36:49,988 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:36:49,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49 WrapperNode [2018-11-18 12:36:49,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:36:49,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:36:49,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:36:49,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:36:50,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... [2018-11-18 12:36:50,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:36:50,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:36:50,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:36:50,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:36:50,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:36:50,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-18 12:36:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2018-11-18 12:36:50,082 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2018-11-18 12:36:50,082 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2018-11-18 12:36:50,082 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2018-11-18 12:36:50,082 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:36:50,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2018-11-18 12:36:50,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:36:50,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 12:36:50,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-18 12:36:50,082 INFO L130 BoogieDeclarations]: Found specification of procedure read [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure write [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2018-11-18 12:36:50,083 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:36:50,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:36:50,949 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:36:50,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:36:50 BoogieIcfgContainer [2018-11-18 12:36:50,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:36:50,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:36:50,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:36:50,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:36:50,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:36:49" (1/3) ... [2018-11-18 12:36:50,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a26432c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:36:50, skipping insertion in model container [2018-11-18 12:36:50,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:36:49" (2/3) ... [2018-11-18 12:36:50,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a26432c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:36:50, skipping insertion in model container [2018-11-18 12:36:50,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:36:50" (3/3) ... [2018-11-18 12:36:50,956 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 12:36:50,964 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:36:50,971 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:36:50,984 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:36:51,009 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:36:51,009 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:36:51,010 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:36:51,010 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:36:51,010 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:36:51,010 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:36:51,010 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:36:51,010 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:36:51,010 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:36:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2018-11-18 12:36:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:36:51,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:51,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:51,036 INFO L423 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash -936030524, now seen corresponding path program 1 times [2018-11-18 12:36:51,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:36:51,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:51,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:51,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:51,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:51,267 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 4 states. [2018-11-18 12:36:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:51,443 INFO L93 Difference]: Finished difference Result 423 states and 683 transitions. [2018-11-18 12:36:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:51,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 12:36:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:51,456 INFO L225 Difference]: With dead ends: 423 [2018-11-18 12:36:51,456 INFO L226 Difference]: Without dead ends: 215 [2018-11-18 12:36:51,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-18 12:36:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-11-18 12:36:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-18 12:36:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 316 transitions. [2018-11-18 12:36:51,520 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 316 transitions. Word has length 22 [2018-11-18 12:36:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:51,520 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 316 transitions. [2018-11-18 12:36:51,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 316 transitions. [2018-11-18 12:36:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 12:36:51,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:51,525 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:51,525 INFO L423 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:51,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1583201924, now seen corresponding path program 1 times [2018-11-18 12:36:51,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:51,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:36:51,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:51,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:51,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:51,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:51,618 INFO L87 Difference]: Start difference. First operand 213 states and 316 transitions. Second operand 4 states. [2018-11-18 12:36:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:51,695 INFO L93 Difference]: Finished difference Result 435 states and 651 transitions. [2018-11-18 12:36:51,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:51,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-18 12:36:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:51,698 INFO L225 Difference]: With dead ends: 435 [2018-11-18 12:36:51,698 INFO L226 Difference]: Without dead ends: 231 [2018-11-18 12:36:51,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-18 12:36:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2018-11-18 12:36:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-18 12:36:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 334 transitions. [2018-11-18 12:36:51,718 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 334 transitions. Word has length 23 [2018-11-18 12:36:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:51,718 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 334 transitions. [2018-11-18 12:36:51,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 334 transitions. [2018-11-18 12:36:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 12:36:51,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:51,720 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:51,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:51,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1746016789, now seen corresponding path program 1 times [2018-11-18 12:36:51,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:51,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:51,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:51,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:36:51,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:51,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:36:51,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:36:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:36:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:36:51,764 INFO L87 Difference]: Start difference. First operand 228 states and 334 transitions. Second operand 3 states. [2018-11-18 12:36:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:51,804 INFO L93 Difference]: Finished difference Result 470 states and 700 transitions. [2018-11-18 12:36:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:36:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 12:36:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:51,807 INFO L225 Difference]: With dead ends: 470 [2018-11-18 12:36:51,807 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 12:36:51,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:36:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 12:36:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2018-11-18 12:36:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 12:36:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 338 transitions. [2018-11-18 12:36:51,826 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 338 transitions. Word has length 32 [2018-11-18 12:36:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:51,826 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 338 transitions. [2018-11-18 12:36:51,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:36:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2018-11-18 12:36:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:36:51,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:51,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:51,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:51,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash 271754470, now seen corresponding path program 1 times [2018-11-18 12:36:51,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:51,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:36:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:36:51,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:36:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:36:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:51,942 INFO L87 Difference]: Start difference. First operand 232 states and 338 transitions. Second operand 5 states. [2018-11-18 12:36:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:51,999 INFO L93 Difference]: Finished difference Result 448 states and 659 transitions. [2018-11-18 12:36:52,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:52,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 12:36:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:52,003 INFO L225 Difference]: With dead ends: 448 [2018-11-18 12:36:52,003 INFO L226 Difference]: Without dead ends: 240 [2018-11-18 12:36:52,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-18 12:36:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2018-11-18 12:36:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-18 12:36:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2018-11-18 12:36:52,019 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 40 [2018-11-18 12:36:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:52,020 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2018-11-18 12:36:52,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:36:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2018-11-18 12:36:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 12:36:52,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:52,021 INFO L375 BasicCegarLoop]: trace 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] [2018-11-18 12:36:52,021 INFO L423 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:52,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash -13136149, now seen corresponding path program 1 times [2018-11-18 12:36:52,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:52,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:52,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:36:52,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:52,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:52,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:52,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:52,085 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand 4 states. [2018-11-18 12:36:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:52,103 INFO L93 Difference]: Finished difference Result 406 states and 595 transitions. [2018-11-18 12:36:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:52,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-18 12:36:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:52,105 INFO L225 Difference]: With dead ends: 406 [2018-11-18 12:36:52,105 INFO L226 Difference]: Without dead ends: 232 [2018-11-18 12:36:52,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-18 12:36:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-11-18 12:36:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 12:36:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 333 transitions. [2018-11-18 12:36:52,118 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 333 transitions. Word has length 41 [2018-11-18 12:36:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:52,119 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 333 transitions. [2018-11-18 12:36:52,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 333 transitions. [2018-11-18 12:36:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 12:36:52,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:52,120 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 12:36:52,120 INFO L423 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:52,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1264596613, now seen corresponding path program 1 times [2018-11-18 12:36:52,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:52,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:36:52,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:52,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:52,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:52,191 INFO L87 Difference]: Start difference. First operand 232 states and 333 transitions. Second operand 4 states. [2018-11-18 12:36:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:52,271 INFO L93 Difference]: Finished difference Result 461 states and 671 transitions. [2018-11-18 12:36:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:52,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-18 12:36:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:52,273 INFO L225 Difference]: With dead ends: 461 [2018-11-18 12:36:52,273 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 12:36:52,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 12:36:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-11-18 12:36:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 12:36:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 355 transitions. [2018-11-18 12:36:52,302 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 355 transitions. Word has length 44 [2018-11-18 12:36:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:52,303 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 355 transitions. [2018-11-18 12:36:52,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 355 transitions. [2018-11-18 12:36:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 12:36:52,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:52,304 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 12:36:52,305 INFO L423 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:52,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1252036746, now seen corresponding path program 1 times [2018-11-18 12:36:52,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:52,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:52,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 12:36:52,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:52,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:52,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:52,363 INFO L87 Difference]: Start difference. First operand 251 states and 355 transitions. Second operand 4 states. [2018-11-18 12:36:52,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:52,477 INFO L93 Difference]: Finished difference Result 483 states and 701 transitions. [2018-11-18 12:36:52,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:52,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-18 12:36:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:52,479 INFO L225 Difference]: With dead ends: 483 [2018-11-18 12:36:52,480 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 12:36:52,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 12:36:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-11-18 12:36:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 12:36:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 363 transitions. [2018-11-18 12:36:52,491 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 363 transitions. Word has length 44 [2018-11-18 12:36:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:52,491 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 363 transitions. [2018-11-18 12:36:52,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 363 transitions. [2018-11-18 12:36:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 12:36:52,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:52,493 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-11-18 12:36:52,493 INFO L423 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:52,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 276989828, now seen corresponding path program 1 times [2018-11-18 12:36:52,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 12:36:52,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:52,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:36:52,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:36:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:36:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:52,562 INFO L87 Difference]: Start difference. First operand 258 states and 363 transitions. Second operand 5 states. [2018-11-18 12:36:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:52,584 INFO L93 Difference]: Finished difference Result 481 states and 687 transitions. [2018-11-18 12:36:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:52,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-18 12:36:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:52,587 INFO L225 Difference]: With dead ends: 481 [2018-11-18 12:36:52,587 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 12:36:52,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 12:36:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-11-18 12:36:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 12:36:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 362 transitions. [2018-11-18 12:36:52,598 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 362 transitions. Word has length 63 [2018-11-18 12:36:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:52,598 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 362 transitions. [2018-11-18 12:36:52,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:36:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2018-11-18 12:36:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 12:36:52,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:52,600 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2018-11-18 12:36:52,600 INFO L423 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:52,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash 237083171, now seen corresponding path program 1 times [2018-11-18 12:36:52,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:52,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 12:36:52,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:52,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:52,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:52,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:52,647 INFO L87 Difference]: Start difference. First operand 258 states and 362 transitions. Second operand 4 states. [2018-11-18 12:36:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:52,697 INFO L93 Difference]: Finished difference Result 498 states and 712 transitions. [2018-11-18 12:36:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:52,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-18 12:36:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:52,699 INFO L225 Difference]: With dead ends: 498 [2018-11-18 12:36:52,700 INFO L226 Difference]: Without dead ends: 282 [2018-11-18 12:36:52,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-18 12:36:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2018-11-18 12:36:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-18 12:36:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 386 transitions. [2018-11-18 12:36:52,727 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 386 transitions. Word has length 67 [2018-11-18 12:36:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:52,728 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 386 transitions. [2018-11-18 12:36:52,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 386 transitions. [2018-11-18 12:36:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 12:36:52,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:52,729 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 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] [2018-11-18 12:36:52,729 INFO L423 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:52,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash -721431234, now seen corresponding path program 1 times [2018-11-18 12:36:52,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:52,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:52,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 12:36:52,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:52,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:52,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:52,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:52,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:52,966 INFO L87 Difference]: Start difference. First operand 279 states and 386 transitions. Second operand 4 states. [2018-11-18 12:36:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:53,487 INFO L93 Difference]: Finished difference Result 507 states and 718 transitions. [2018-11-18 12:36:53,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:53,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-18 12:36:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:53,491 INFO L225 Difference]: With dead ends: 507 [2018-11-18 12:36:53,491 INFO L226 Difference]: Without dead ends: 273 [2018-11-18 12:36:53,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-18 12:36:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-11-18 12:36:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 12:36:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 372 transitions. [2018-11-18 12:36:53,501 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 372 transitions. Word has length 68 [2018-11-18 12:36:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:53,501 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 372 transitions. [2018-11-18 12:36:53,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 372 transitions. [2018-11-18 12:36:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 12:36:53,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:53,503 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:53,503 INFO L423 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:53,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash -208411952, now seen corresponding path program 1 times [2018-11-18 12:36:53,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:53,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 12:36:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:53,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:36:53,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:36:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:36:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:53,585 INFO L87 Difference]: Start difference. First operand 273 states and 372 transitions. Second operand 5 states. [2018-11-18 12:36:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:53,604 INFO L93 Difference]: Finished difference Result 493 states and 684 transitions. [2018-11-18 12:36:53,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:53,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-11-18 12:36:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:53,606 INFO L225 Difference]: With dead ends: 493 [2018-11-18 12:36:53,606 INFO L226 Difference]: Without dead ends: 275 [2018-11-18 12:36:53,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-18 12:36:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-11-18 12:36:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 12:36:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 371 transitions. [2018-11-18 12:36:53,617 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 371 transitions. Word has length 88 [2018-11-18 12:36:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:53,617 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 371 transitions. [2018-11-18 12:36:53,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:36:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 371 transitions. [2018-11-18 12:36:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 12:36:53,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:53,618 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 12:36:53,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:53,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 264007535, now seen corresponding path program 1 times [2018-11-18 12:36:53,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:53,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 12:36:53,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:53,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:53,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:53,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:53,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:53,662 INFO L87 Difference]: Start difference. First operand 273 states and 371 transitions. Second operand 4 states. [2018-11-18 12:36:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:53,710 INFO L93 Difference]: Finished difference Result 481 states and 681 transitions. [2018-11-18 12:36:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:53,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-18 12:36:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:53,712 INFO L225 Difference]: With dead ends: 481 [2018-11-18 12:36:53,712 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 12:36:53,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 12:36:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-11-18 12:36:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-18 12:36:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 367 transitions. [2018-11-18 12:36:53,722 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 367 transitions. Word has length 92 [2018-11-18 12:36:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:53,723 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 367 transitions. [2018-11-18 12:36:53,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2018-11-18 12:36:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 12:36:53,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:53,724 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:53,724 INFO L423 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:53,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash 525284459, now seen corresponding path program 1 times [2018-11-18 12:36:53,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:53,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:53,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 12:36:53,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:36:53,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:36:53,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:53,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:36:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 12:36:53,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:36:53,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 12:36:53,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:36:53,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:36:53,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:36:53,949 INFO L87 Difference]: Start difference. First operand 271 states and 367 transitions. Second operand 6 states. [2018-11-18 12:36:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:54,161 INFO L93 Difference]: Finished difference Result 645 states and 885 transitions. [2018-11-18 12:36:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:36:54,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-11-18 12:36:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:54,163 INFO L225 Difference]: With dead ends: 645 [2018-11-18 12:36:54,163 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 12:36:54,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:36:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 12:36:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 281. [2018-11-18 12:36:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 12:36:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2018-11-18 12:36:54,180 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 109 [2018-11-18 12:36:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:54,180 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2018-11-18 12:36:54,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:36:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2018-11-18 12:36:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 12:36:54,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:54,182 INFO L375 BasicCegarLoop]: trace histogram [10, 7, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:54,182 INFO L423 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:54,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -253170207, now seen corresponding path program 1 times [2018-11-18 12:36:54,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-18 12:36:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:54,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:36:54,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:36:54,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:36:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:54,253 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand 5 states. [2018-11-18 12:36:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:54,269 INFO L93 Difference]: Finished difference Result 454 states and 616 transitions. [2018-11-18 12:36:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:54,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-18 12:36:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:54,272 INFO L225 Difference]: With dead ends: 454 [2018-11-18 12:36:54,272 INFO L226 Difference]: Without dead ends: 281 [2018-11-18 12:36:54,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-18 12:36:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-18 12:36:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 12:36:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 367 transitions. [2018-11-18 12:36:54,283 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 367 transitions. Word has length 155 [2018-11-18 12:36:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:54,283 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 367 transitions. [2018-11-18 12:36:54,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:36:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 367 transitions. [2018-11-18 12:36:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 12:36:54,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:54,285 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:54,286 INFO L423 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 608568968, now seen corresponding path program 1 times [2018-11-18 12:36:54,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-18 12:36:54,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:54,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:54,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:54,364 INFO L87 Difference]: Start difference. First operand 281 states and 367 transitions. Second operand 4 states. [2018-11-18 12:36:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:54,407 INFO L93 Difference]: Finished difference Result 453 states and 616 transitions. [2018-11-18 12:36:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:54,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-11-18 12:36:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:54,409 INFO L225 Difference]: With dead ends: 453 [2018-11-18 12:36:54,409 INFO L226 Difference]: Without dead ends: 287 [2018-11-18 12:36:54,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-18 12:36:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-11-18 12:36:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 12:36:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 370 transitions. [2018-11-18 12:36:54,419 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 370 transitions. Word has length 174 [2018-11-18 12:36:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:54,420 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 370 transitions. [2018-11-18 12:36:54,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 370 transitions. [2018-11-18 12:36:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-18 12:36:54,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:54,422 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:54,422 INFO L423 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:54,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1006396167, now seen corresponding path program 1 times [2018-11-18 12:36:54,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-18 12:36:54,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:54,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:54,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:54,492 INFO L87 Difference]: Start difference. First operand 285 states and 370 transitions. Second operand 4 states. [2018-11-18 12:36:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:54,520 INFO L93 Difference]: Finished difference Result 462 states and 623 transitions. [2018-11-18 12:36:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:54,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-18 12:36:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:54,522 INFO L225 Difference]: With dead ends: 462 [2018-11-18 12:36:54,523 INFO L226 Difference]: Without dead ends: 292 [2018-11-18 12:36:54,523 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-18 12:36:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-11-18 12:36:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-18 12:36:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 374 transitions. [2018-11-18 12:36:54,533 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 374 transitions. Word has length 186 [2018-11-18 12:36:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:54,533 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 374 transitions. [2018-11-18 12:36:54,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 374 transitions. [2018-11-18 12:36:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 12:36:54,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:54,535 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:54,536 INFO L423 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:54,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash -713088293, now seen corresponding path program 1 times [2018-11-18 12:36:54,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:54,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:54,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:54,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-18 12:36:54,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:54,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:54,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:54,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:54,603 INFO L87 Difference]: Start difference. First operand 290 states and 374 transitions. Second operand 4 states. [2018-11-18 12:36:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:54,630 INFO L93 Difference]: Finished difference Result 464 states and 621 transitions. [2018-11-18 12:36:54,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:54,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-11-18 12:36:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:54,633 INFO L225 Difference]: With dead ends: 464 [2018-11-18 12:36:54,633 INFO L226 Difference]: Without dead ends: 289 [2018-11-18 12:36:54,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-18 12:36:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-11-18 12:36:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-18 12:36:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 369 transitions. [2018-11-18 12:36:54,642 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 369 transitions. Word has length 199 [2018-11-18 12:36:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:54,643 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 369 transitions. [2018-11-18 12:36:54,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 369 transitions. [2018-11-18 12:36:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-18 12:36:54,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:54,645 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:54,645 INFO L423 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:54,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:54,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1116971377, now seen corresponding path program 1 times [2018-11-18 12:36:54,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:54,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:54,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:54,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-18 12:36:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:54,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:54,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:54,739 INFO L87 Difference]: Start difference. First operand 289 states and 369 transitions. Second operand 4 states. [2018-11-18 12:36:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:54,781 INFO L93 Difference]: Finished difference Result 462 states and 611 transitions. [2018-11-18 12:36:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:54,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2018-11-18 12:36:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:54,783 INFO L225 Difference]: With dead ends: 462 [2018-11-18 12:36:54,784 INFO L226 Difference]: Without dead ends: 288 [2018-11-18 12:36:54,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-18 12:36:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-11-18 12:36:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 12:36:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 366 transitions. [2018-11-18 12:36:54,793 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 366 transitions. Word has length 212 [2018-11-18 12:36:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:54,794 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 366 transitions. [2018-11-18 12:36:54,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 366 transitions. [2018-11-18 12:36:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 12:36:54,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:54,796 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:54,796 INFO L423 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:54,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1313874497, now seen corresponding path program 1 times [2018-11-18 12:36:54,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:54,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:54,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:54,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-18 12:36:54,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:54,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:54,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:54,892 INFO L87 Difference]: Start difference. First operand 288 states and 366 transitions. Second operand 4 states. [2018-11-18 12:36:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:55,109 INFO L93 Difference]: Finished difference Result 784 states and 1049 transitions. [2018-11-18 12:36:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:36:55,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-11-18 12:36:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:55,112 INFO L225 Difference]: With dead ends: 784 [2018-11-18 12:36:55,112 INFO L226 Difference]: Without dead ends: 611 [2018-11-18 12:36:55,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:36:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-18 12:36:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 471. [2018-11-18 12:36:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-18 12:36:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 626 transitions. [2018-11-18 12:36:55,125 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 626 transitions. Word has length 214 [2018-11-18 12:36:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:55,126 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 626 transitions. [2018-11-18 12:36:55,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 626 transitions. [2018-11-18 12:36:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 12:36:55,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:55,129 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:55,129 INFO L423 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:55,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051250, now seen corresponding path program 1 times [2018-11-18 12:36:55,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:55,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:55,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 12:36:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:55,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:55,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:55,212 INFO L87 Difference]: Start difference. First operand 471 states and 626 transitions. Second operand 4 states. [2018-11-18 12:36:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:55,366 INFO L93 Difference]: Finished difference Result 1194 states and 1640 transitions. [2018-11-18 12:36:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:55,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2018-11-18 12:36:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:55,370 INFO L225 Difference]: With dead ends: 1194 [2018-11-18 12:36:55,370 INFO L226 Difference]: Without dead ends: 838 [2018-11-18 12:36:55,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-18 12:36:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 821. [2018-11-18 12:36:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-18 12:36:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1106 transitions. [2018-11-18 12:36:55,396 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1106 transitions. Word has length 249 [2018-11-18 12:36:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:55,396 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1106 transitions. [2018-11-18 12:36:55,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1106 transitions. [2018-11-18 12:36:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 12:36:55,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:55,400 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:55,400 INFO L423 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:55,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash -423521950, now seen corresponding path program 1 times [2018-11-18 12:36:55,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:55,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:55,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 12:36:55,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:55,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:55,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:55,482 INFO L87 Difference]: Start difference. First operand 821 states and 1106 transitions. Second operand 4 states. [2018-11-18 12:36:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:55,681 INFO L93 Difference]: Finished difference Result 2172 states and 3003 transitions. [2018-11-18 12:36:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:55,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2018-11-18 12:36:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:55,687 INFO L225 Difference]: With dead ends: 2172 [2018-11-18 12:36:55,687 INFO L226 Difference]: Without dead ends: 1493 [2018-11-18 12:36:55,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-11-18 12:36:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1128. [2018-11-18 12:36:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-11-18 12:36:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1534 transitions. [2018-11-18 12:36:55,731 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1534 transitions. Word has length 250 [2018-11-18 12:36:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:55,731 INFO L480 AbstractCegarLoop]: Abstraction has 1128 states and 1534 transitions. [2018-11-18 12:36:55,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1534 transitions. [2018-11-18 12:36:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-18 12:36:55,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:55,734 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:55,734 INFO L423 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:55,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash 100706089, now seen corresponding path program 1 times [2018-11-18 12:36:55,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:55,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:55,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 12:36:55,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:55,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:36:55,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:36:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:36:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:55,815 INFO L87 Difference]: Start difference. First operand 1128 states and 1534 transitions. Second operand 4 states. [2018-11-18 12:36:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:56,047 INFO L93 Difference]: Finished difference Result 3120 states and 4326 transitions. [2018-11-18 12:36:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:36:56,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-11-18 12:36:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:56,055 INFO L225 Difference]: With dead ends: 3120 [2018-11-18 12:36:56,055 INFO L226 Difference]: Without dead ends: 2134 [2018-11-18 12:36:56,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:36:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-11-18 12:36:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1418. [2018-11-18 12:36:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2018-11-18 12:36:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1940 transitions. [2018-11-18 12:36:56,119 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1940 transitions. Word has length 251 [2018-11-18 12:36:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:56,119 INFO L480 AbstractCegarLoop]: Abstraction has 1418 states and 1940 transitions. [2018-11-18 12:36:56,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:36:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1940 transitions. [2018-11-18 12:36:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-18 12:36:56,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:56,123 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:56,123 INFO L423 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:56,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2143277209, now seen corresponding path program 1 times [2018-11-18 12:36:56,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:56,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-11-18 12:36:56,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:36:56,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:36:56,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:56,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:36:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 123 proven. 11 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-18 12:36:56,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:36:56,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-18 12:36:56,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:36:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:36:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:36:56,609 INFO L87 Difference]: Start difference. First operand 1418 states and 1940 transitions. Second operand 10 states. [2018-11-18 12:36:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:56,907 INFO L93 Difference]: Finished difference Result 2925 states and 4037 transitions. [2018-11-18 12:36:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:36:56,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 251 [2018-11-18 12:36:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:56,914 INFO L225 Difference]: With dead ends: 2925 [2018-11-18 12:36:56,914 INFO L226 Difference]: Without dead ends: 1449 [2018-11-18 12:36:56,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:36:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2018-11-18 12:36:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1449. [2018-11-18 12:36:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2018-11-18 12:36:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1933 transitions. [2018-11-18 12:36:57,004 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1933 transitions. Word has length 251 [2018-11-18 12:36:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:57,005 INFO L480 AbstractCegarLoop]: Abstraction has 1449 states and 1933 transitions. [2018-11-18 12:36:57,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:36:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1933 transitions. [2018-11-18 12:36:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-18 12:36:57,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:57,011 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:57,011 INFO L423 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:57,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2133895100, now seen corresponding path program 1 times [2018-11-18 12:36:57,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:57,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:57,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-18 12:36:57,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:36:57,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:36:57,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:57,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:36:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2018-11-18 12:36:58,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:36:58,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-18 12:36:58,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:36:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:36:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:36:58,098 INFO L87 Difference]: Start difference. First operand 1449 states and 1933 transitions. Second operand 9 states. [2018-11-18 12:36:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:59,552 INFO L93 Difference]: Finished difference Result 2823 states and 3907 transitions. [2018-11-18 12:36:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:36:59,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 309 [2018-11-18 12:36:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:59,561 INFO L225 Difference]: With dead ends: 2823 [2018-11-18 12:36:59,561 INFO L226 Difference]: Without dead ends: 1508 [2018-11-18 12:36:59,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:36:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2018-11-18 12:36:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2018-11-18 12:36:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 12:36:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1978 transitions. [2018-11-18 12:36:59,639 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1978 transitions. Word has length 309 [2018-11-18 12:36:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:36:59,640 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 1978 transitions. [2018-11-18 12:36:59,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:36:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1978 transitions. [2018-11-18 12:36:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-11-18 12:36:59,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:36:59,648 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:36:59,648 INFO L423 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:36:59,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:36:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1711213979, now seen corresponding path program 1 times [2018-11-18 12:36:59,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:36:59,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:36:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:59,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:36:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:36:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:36:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-18 12:36:59,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:36:59,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:36:59,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:36:59,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:36:59,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:36:59,815 INFO L87 Difference]: Start difference. First operand 1508 states and 1978 transitions. Second operand 3 states. [2018-11-18 12:36:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:36:59,929 INFO L93 Difference]: Finished difference Result 2592 states and 3423 transitions. [2018-11-18 12:36:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:36:59,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2018-11-18 12:36:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:36:59,937 INFO L225 Difference]: With dead ends: 2592 [2018-11-18 12:36:59,937 INFO L226 Difference]: Without dead ends: 1201 [2018-11-18 12:36:59,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:36:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2018-11-18 12:36:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2018-11-18 12:36:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2018-11-18 12:37:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1563 transitions. [2018-11-18 12:37:00,001 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1563 transitions. Word has length 310 [2018-11-18 12:37:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:00,002 INFO L480 AbstractCegarLoop]: Abstraction has 1201 states and 1563 transitions. [2018-11-18 12:37:00,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:37:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1563 transitions. [2018-11-18 12:37:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-11-18 12:37:00,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:00,009 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:00,009 INFO L423 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:00,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash 569113092, now seen corresponding path program 1 times [2018-11-18 12:37:00,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:00,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:00,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:00,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:00,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-11-18 12:37:00,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:00,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:00,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-18 12:37:01,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:37:01,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-18 12:37:01,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:37:01,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:37:01,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:37:01,211 INFO L87 Difference]: Start difference. First operand 1201 states and 1563 transitions. Second operand 14 states. [2018-11-18 12:37:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:02,443 INFO L93 Difference]: Finished difference Result 1264 states and 1672 transitions. [2018-11-18 12:37:02,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:37:02,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 310 [2018-11-18 12:37:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:02,450 INFO L225 Difference]: With dead ends: 1264 [2018-11-18 12:37:02,450 INFO L226 Difference]: Without dead ends: 1262 [2018-11-18 12:37:02,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:37:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-11-18 12:37:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1225. [2018-11-18 12:37:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 12:37:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1590 transitions. [2018-11-18 12:37:02,514 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1590 transitions. Word has length 310 [2018-11-18 12:37:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:02,514 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1590 transitions. [2018-11-18 12:37:02,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:37:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1590 transitions. [2018-11-18 12:37:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-18 12:37:02,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:02,522 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:02,522 INFO L423 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:02,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash 295869767, now seen corresponding path program 1 times [2018-11-18 12:37:02,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:02,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:02,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 190 proven. 30 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2018-11-18 12:37:03,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:03,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:03,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 299 proven. 36 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-11-18 12:37:04,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:37:04,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-11-18 12:37:04,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 12:37:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 12:37:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-18 12:37:04,471 INFO L87 Difference]: Start difference. First operand 1225 states and 1590 transitions. Second operand 21 states. [2018-11-18 12:37:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:08,456 INFO L93 Difference]: Finished difference Result 4419 states and 5904 transitions. [2018-11-18 12:37:08,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 12:37:08,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 318 [2018-11-18 12:37:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:08,470 INFO L225 Difference]: With dead ends: 4419 [2018-11-18 12:37:08,470 INFO L226 Difference]: Without dead ends: 3366 [2018-11-18 12:37:08,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 12:37:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3366 states. [2018-11-18 12:37:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3366 to 2925. [2018-11-18 12:37:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-11-18 12:37:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3879 transitions. [2018-11-18 12:37:08,644 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3879 transitions. Word has length 318 [2018-11-18 12:37:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:08,645 INFO L480 AbstractCegarLoop]: Abstraction has 2925 states and 3879 transitions. [2018-11-18 12:37:08,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 12:37:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3879 transitions. [2018-11-18 12:37:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-18 12:37:08,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:08,651 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:08,651 INFO L423 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:08,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash 988971464, now seen corresponding path program 1 times [2018-11-18 12:37:08,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:08,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:08,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:08,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-11-18 12:37:08,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:08,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:08,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:09,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2018-11-18 12:37:09,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:37:09,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-18 12:37:09,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:37:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:37:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:37:09,090 INFO L87 Difference]: Start difference. First operand 2925 states and 3879 transitions. Second operand 4 states. [2018-11-18 12:37:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:09,459 INFO L93 Difference]: Finished difference Result 4635 states and 6029 transitions. [2018-11-18 12:37:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:37:09,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2018-11-18 12:37:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:09,473 INFO L225 Difference]: With dead ends: 4635 [2018-11-18 12:37:09,473 INFO L226 Difference]: Without dead ends: 2412 [2018-11-18 12:37:09,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:37:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2018-11-18 12:37:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2412. [2018-11-18 12:37:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2018-11-18 12:37:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3048 transitions. [2018-11-18 12:37:09,625 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3048 transitions. Word has length 318 [2018-11-18 12:37:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:09,625 INFO L480 AbstractCegarLoop]: Abstraction has 2412 states and 3048 transitions. [2018-11-18 12:37:09,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:37:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3048 transitions. [2018-11-18 12:37:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-18 12:37:09,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:09,633 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:09,633 INFO L423 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:09,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash -327530359, now seen corresponding path program 1 times [2018-11-18 12:37:09,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:09,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-18 12:37:09,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:09,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:09,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:10,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-18 12:37:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:37:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-11-18 12:37:10,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 12:37:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 12:37:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:37:10,266 INFO L87 Difference]: Start difference. First operand 2412 states and 3048 transitions. Second operand 19 states. [2018-11-18 12:37:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:13,584 INFO L93 Difference]: Finished difference Result 4701 states and 5954 transitions. [2018-11-18 12:37:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-18 12:37:13,584 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 333 [2018-11-18 12:37:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:13,593 INFO L225 Difference]: With dead ends: 4701 [2018-11-18 12:37:13,593 INFO L226 Difference]: Without dead ends: 3012 [2018-11-18 12:37:13,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=2718, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 12:37:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2018-11-18 12:37:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2394. [2018-11-18 12:37:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2018-11-18 12:37:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 2937 transitions. [2018-11-18 12:37:13,727 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 2937 transitions. Word has length 333 [2018-11-18 12:37:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:13,728 INFO L480 AbstractCegarLoop]: Abstraction has 2394 states and 2937 transitions. [2018-11-18 12:37:13,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 12:37:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 2937 transitions. [2018-11-18 12:37:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-18 12:37:13,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:13,733 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:13,733 INFO L423 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:13,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1509045284, now seen corresponding path program 1 times [2018-11-18 12:37:13,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:13,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:13,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-18 12:37:14,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:14,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:14,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-18 12:37:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:37:14,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-11-18 12:37:14,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 12:37:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 12:37:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:37:14,622 INFO L87 Difference]: Start difference. First operand 2394 states and 2937 transitions. Second operand 19 states. [2018-11-18 12:37:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:17,291 INFO L93 Difference]: Finished difference Result 4692 states and 5796 transitions. [2018-11-18 12:37:17,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 12:37:17,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 335 [2018-11-18 12:37:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:17,312 INFO L225 Difference]: With dead ends: 4692 [2018-11-18 12:37:17,313 INFO L226 Difference]: Without dead ends: 3075 [2018-11-18 12:37:17,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=2218, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 12:37:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2018-11-18 12:37:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2211. [2018-11-18 12:37:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2018-11-18 12:37:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2685 transitions. [2018-11-18 12:37:17,447 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2685 transitions. Word has length 335 [2018-11-18 12:37:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:17,447 INFO L480 AbstractCegarLoop]: Abstraction has 2211 states and 2685 transitions. [2018-11-18 12:37:17,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 12:37:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2685 transitions. [2018-11-18 12:37:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-18 12:37:17,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:17,453 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:17,454 INFO L423 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:17,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1589193313, now seen corresponding path program 1 times [2018-11-18 12:37:17,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:17,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-11-18 12:37:17,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:17,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:17,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:17,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-11-18 12:37:18,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:37:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-11-18 12:37:18,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 12:37:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 12:37:18,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:37:18,058 INFO L87 Difference]: Start difference. First operand 2211 states and 2685 transitions. Second operand 19 states. [2018-11-18 12:37:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:21,757 INFO L93 Difference]: Finished difference Result 6054 states and 7460 transitions. [2018-11-18 12:37:21,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 12:37:21,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 339 [2018-11-18 12:37:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:21,786 INFO L225 Difference]: With dead ends: 6054 [2018-11-18 12:37:21,787 INFO L226 Difference]: Without dead ends: 4425 [2018-11-18 12:37:21,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 12:37:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2018-11-18 12:37:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 2715. [2018-11-18 12:37:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2018-11-18 12:37:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3276 transitions. [2018-11-18 12:37:21,989 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3276 transitions. Word has length 339 [2018-11-18 12:37:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:21,989 INFO L480 AbstractCegarLoop]: Abstraction has 2715 states and 3276 transitions. [2018-11-18 12:37:21,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 12:37:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3276 transitions. [2018-11-18 12:37:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-18 12:37:21,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:21,996 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:21,996 INFO L423 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:21,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1920180709, now seen corresponding path program 1 times [2018-11-18 12:37:21,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2018-11-18 12:37:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:37:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:37:22,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:37:22,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:37:22,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:37:22,137 INFO L87 Difference]: Start difference. First operand 2715 states and 3276 transitions. Second operand 6 states. [2018-11-18 12:37:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:22,505 INFO L93 Difference]: Finished difference Result 5730 states and 7397 transitions. [2018-11-18 12:37:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:37:22,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 339 [2018-11-18 12:37:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:22,516 INFO L225 Difference]: With dead ends: 5730 [2018-11-18 12:37:22,516 INFO L226 Difference]: Without dead ends: 4083 [2018-11-18 12:37:22,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:37:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2018-11-18 12:37:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 2877. [2018-11-18 12:37:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2018-11-18 12:37:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3516 transitions. [2018-11-18 12:37:22,738 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3516 transitions. Word has length 339 [2018-11-18 12:37:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:22,739 INFO L480 AbstractCegarLoop]: Abstraction has 2877 states and 3516 transitions. [2018-11-18 12:37:22,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:37:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3516 transitions. [2018-11-18 12:37:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-18 12:37:22,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:22,743 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:22,743 INFO L423 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:22,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -694577734, now seen corresponding path program 1 times [2018-11-18 12:37:22,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-11-18 12:37:23,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:37:23,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-18 12:37:23,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:37:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:37:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:37:23,146 INFO L87 Difference]: Start difference. First operand 2877 states and 3516 transitions. Second operand 16 states. [2018-11-18 12:37:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:24,858 INFO L93 Difference]: Finished difference Result 4548 states and 5593 transitions. [2018-11-18 12:37:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 12:37:24,858 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 342 [2018-11-18 12:37:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:24,864 INFO L225 Difference]: With dead ends: 4548 [2018-11-18 12:37:24,864 INFO L226 Difference]: Without dead ends: 2250 [2018-11-18 12:37:24,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 12:37:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2018-11-18 12:37:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2217. [2018-11-18 12:37:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2018-11-18 12:37:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2694 transitions. [2018-11-18 12:37:25,035 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2694 transitions. Word has length 342 [2018-11-18 12:37:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:25,035 INFO L480 AbstractCegarLoop]: Abstraction has 2217 states and 2694 transitions. [2018-11-18 12:37:25,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:37:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2694 transitions. [2018-11-18 12:37:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-11-18 12:37:25,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:25,041 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 12:37:25,041 INFO L423 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:25,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1625891487, now seen corresponding path program 1 times [2018-11-18 12:37:25,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:25,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:25,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2018-11-18 12:37:25,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:25,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:25,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 229 proven. 95 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-11-18 12:37:25,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:37:25,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-11-18 12:37:25,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 12:37:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 12:37:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1120, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 12:37:25,981 INFO L87 Difference]: Start difference. First operand 2217 states and 2694 transitions. Second operand 35 states. [2018-11-18 12:37:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:53,241 INFO L93 Difference]: Finished difference Result 11821 states and 15053 transitions. [2018-11-18 12:37:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 528 states. [2018-11-18 12:37:53,242 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 412 [2018-11-18 12:37:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:53,267 INFO L225 Difference]: With dead ends: 11821 [2018-11-18 12:37:53,267 INFO L226 Difference]: Without dead ends: 10183 [2018-11-18 12:37:53,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1091 GetRequests, 521 SyntacticMatches, 11 SemanticMatches, 559 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138232 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17274, Invalid=296886, Unknown=0, NotChecked=0, Total=314160 [2018-11-18 12:37:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10183 states. [2018-11-18 12:37:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10183 to 6637. [2018-11-18 12:37:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6637 states. [2018-11-18 12:37:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6637 states to 6637 states and 7986 transitions. [2018-11-18 12:37:53,751 INFO L78 Accepts]: Start accepts. Automaton has 6637 states and 7986 transitions. Word has length 412 [2018-11-18 12:37:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:53,752 INFO L480 AbstractCegarLoop]: Abstraction has 6637 states and 7986 transitions. [2018-11-18 12:37:53,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 12:37:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6637 states and 7986 transitions. [2018-11-18 12:37:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-11-18 12:37:53,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:53,761 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 12:37:53,761 INFO L423 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:53,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1341221058, now seen corresponding path program 1 times [2018-11-18 12:37:53,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2018-11-18 12:37:53,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:53,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:53,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:54,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-11-18 12:37:54,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:37:54,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-18 12:37:54,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:37:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:37:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:37:54,162 INFO L87 Difference]: Start difference. First operand 6637 states and 7986 transitions. Second operand 4 states. [2018-11-18 12:37:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:54,679 INFO L93 Difference]: Finished difference Result 13122 states and 15809 transitions. [2018-11-18 12:37:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:37:54,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2018-11-18 12:37:54,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:54,693 INFO L225 Difference]: With dead ends: 13122 [2018-11-18 12:37:54,693 INFO L226 Difference]: Without dead ends: 6557 [2018-11-18 12:37:54,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:37:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2018-11-18 12:37:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 6557. [2018-11-18 12:37:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6557 states. [2018-11-18 12:37:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 7706 transitions. [2018-11-18 12:37:55,113 INFO L78 Accepts]: Start accepts. Automaton has 6557 states and 7706 transitions. Word has length 412 [2018-11-18 12:37:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:55,114 INFO L480 AbstractCegarLoop]: Abstraction has 6557 states and 7706 transitions. [2018-11-18 12:37:55,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:37:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6557 states and 7706 transitions. [2018-11-18 12:37:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-18 12:37:55,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:55,120 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:55,121 INFO L423 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:55,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash 950032979, now seen corresponding path program 1 times [2018-11-18 12:37:55,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:55,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:55,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 34 proven. 270 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2018-11-18 12:37:55,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:55,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:55,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:37:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 226 proven. 4 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-11-18 12:37:56,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:37:56,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2018-11-18 12:37:56,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 12:37:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 12:37:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-18 12:37:56,025 INFO L87 Difference]: Start difference. First operand 6557 states and 7706 transitions. Second operand 21 states. [2018-11-18 12:37:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:37:58,949 INFO L93 Difference]: Finished difference Result 13946 states and 16324 transitions. [2018-11-18 12:37:58,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 12:37:58,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 413 [2018-11-18 12:37:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:37:58,962 INFO L225 Difference]: With dead ends: 13946 [2018-11-18 12:37:58,962 INFO L226 Difference]: Without dead ends: 7712 [2018-11-18 12:37:58,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=484, Invalid=2822, Unknown=0, NotChecked=0, Total=3306 [2018-11-18 12:37:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2018-11-18 12:37:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 6586. [2018-11-18 12:37:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6586 states. [2018-11-18 12:37:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 7730 transitions. [2018-11-18 12:37:59,426 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 7730 transitions. Word has length 413 [2018-11-18 12:37:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:37:59,427 INFO L480 AbstractCegarLoop]: Abstraction has 6586 states and 7730 transitions. [2018-11-18 12:37:59,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 12:37:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 7730 transitions. [2018-11-18 12:37:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-18 12:37:59,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:37:59,433 INFO L375 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:37:59,433 INFO L423 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:37:59,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:37:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash -99516870, now seen corresponding path program 1 times [2018-11-18 12:37:59,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:37:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:37:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:59,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:37:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-11-18 12:37:59,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:37:59,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:37:59,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:37:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:37:59,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:38:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 457 proven. 208 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-18 12:38:00,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:38:00,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2018-11-18 12:38:00,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-18 12:38:00,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-18 12:38:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2433, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 12:38:00,858 INFO L87 Difference]: Start difference. First operand 6586 states and 7730 transitions. Second operand 51 states. [2018-11-18 12:38:21,615 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-18 12:38:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:38:22,919 INFO L93 Difference]: Finished difference Result 28094 states and 33777 transitions. [2018-11-18 12:38:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-11-18 12:38:22,920 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 423 [2018-11-18 12:38:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:38:22,957 INFO L225 Difference]: With dead ends: 28094 [2018-11-18 12:38:22,957 INFO L226 Difference]: Without dead ends: 22155 [2018-11-18 12:38:22,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 446 SyntacticMatches, 5 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29952 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4500, Invalid=77582, Unknown=0, NotChecked=0, Total=82082 [2018-11-18 12:38:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22155 states. [2018-11-18 12:38:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22155 to 16084. [2018-11-18 12:38:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16084 states. [2018-11-18 12:38:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16084 states to 16084 states and 18996 transitions. [2018-11-18 12:38:23,974 INFO L78 Accepts]: Start accepts. Automaton has 16084 states and 18996 transitions. Word has length 423 [2018-11-18 12:38:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:38:23,975 INFO L480 AbstractCegarLoop]: Abstraction has 16084 states and 18996 transitions. [2018-11-18 12:38:23,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-18 12:38:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16084 states and 18996 transitions. [2018-11-18 12:38:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-11-18 12:38:23,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:38:23,988 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:38:23,988 INFO L423 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:38:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:38:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -604848396, now seen corresponding path program 1 times [2018-11-18 12:38:23,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:38:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:38:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 169 proven. 168 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2018-11-18 12:38:24,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:38:24,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:38:24,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:24,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:38:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 556 proven. 238 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-18 12:38:25,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:38:25,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 36 [2018-11-18 12:38:25,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 12:38:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 12:38:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 12:38:25,124 INFO L87 Difference]: Start difference. First operand 16084 states and 18996 transitions. Second operand 36 states. [2018-11-18 12:38:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:38:30,265 INFO L93 Difference]: Finished difference Result 44956 states and 51932 transitions. [2018-11-18 12:38:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-18 12:38:30,266 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 435 [2018-11-18 12:38:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:38:30,319 INFO L225 Difference]: With dead ends: 44956 [2018-11-18 12:38:30,319 INFO L226 Difference]: Without dead ends: 29484 [2018-11-18 12:38:30,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=546, Invalid=5306, Unknown=0, NotChecked=0, Total=5852 [2018-11-18 12:38:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29484 states. [2018-11-18 12:38:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29484 to 15895. [2018-11-18 12:38:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15895 states. [2018-11-18 12:38:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15895 states to 15895 states and 18771 transitions. [2018-11-18 12:38:31,534 INFO L78 Accepts]: Start accepts. Automaton has 15895 states and 18771 transitions. Word has length 435 [2018-11-18 12:38:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:38:31,535 INFO L480 AbstractCegarLoop]: Abstraction has 15895 states and 18771 transitions. [2018-11-18 12:38:31,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 12:38:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15895 states and 18771 transitions. [2018-11-18 12:38:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-18 12:38:31,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:38:31,547 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:38:31,547 INFO L423 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:38:31,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:38:31,547 INFO L82 PathProgramCache]: Analyzing trace with hash -735203780, now seen corresponding path program 1 times [2018-11-18 12:38:31,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:38:31,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:38:31,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:31,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:31,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2018-11-18 12:38:31,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:38:31,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:38:31,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:32,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:38:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 333 proven. 165 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2018-11-18 12:38:32,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:38:32,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-18 12:38:32,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 12:38:32,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 12:38:32,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:38:32,410 INFO L87 Difference]: Start difference. First operand 15895 states and 18771 transitions. Second operand 18 states. [2018-11-18 12:38:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:38:36,455 INFO L93 Difference]: Finished difference Result 31161 states and 36877 transitions. [2018-11-18 12:38:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-18 12:38:36,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 461 [2018-11-18 12:38:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:38:36,482 INFO L225 Difference]: With dead ends: 31161 [2018-11-18 12:38:36,482 INFO L226 Difference]: Without dead ends: 16361 [2018-11-18 12:38:36,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 468 SyntacticMatches, 22 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=3482, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 12:38:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16361 states. [2018-11-18 12:38:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16361 to 15895. [2018-11-18 12:38:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15895 states. [2018-11-18 12:38:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15895 states to 15895 states and 18750 transitions. [2018-11-18 12:38:37,604 INFO L78 Accepts]: Start accepts. Automaton has 15895 states and 18750 transitions. Word has length 461 [2018-11-18 12:38:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:38:37,605 INFO L480 AbstractCegarLoop]: Abstraction has 15895 states and 18750 transitions. [2018-11-18 12:38:37,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 12:38:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15895 states and 18750 transitions. [2018-11-18 12:38:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-11-18 12:38:37,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:38:37,618 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:38:37,618 INFO L423 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:38:37,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:38:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1125273778, now seen corresponding path program 1 times [2018-11-18 12:38:37,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:38:37,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:38:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:37,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2018-11-18 12:38:37,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:38:37,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:38:37,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:38,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:38:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2018-11-18 12:38:38,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:38:38,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-18 12:38:38,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 12:38:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 12:38:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:38:38,227 INFO L87 Difference]: Start difference. First operand 15895 states and 18750 transitions. Second operand 15 states. [2018-11-18 12:38:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:38:39,966 INFO L93 Difference]: Finished difference Result 30971 states and 36611 transitions. [2018-11-18 12:38:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:38:39,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 469 [2018-11-18 12:38:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:38:39,998 INFO L225 Difference]: With dead ends: 30971 [2018-11-18 12:38:39,998 INFO L226 Difference]: Without dead ends: 15916 [2018-11-18 12:38:40,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:38:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15916 states. [2018-11-18 12:38:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15916 to 15909. [2018-11-18 12:38:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15909 states. [2018-11-18 12:38:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15909 states to 15909 states and 18757 transitions. [2018-11-18 12:38:41,153 INFO L78 Accepts]: Start accepts. Automaton has 15909 states and 18757 transitions. Word has length 469 [2018-11-18 12:38:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:38:41,153 INFO L480 AbstractCegarLoop]: Abstraction has 15909 states and 18757 transitions. [2018-11-18 12:38:41,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 12:38:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15909 states and 18757 transitions. [2018-11-18 12:38:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-18 12:38:41,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:38:41,165 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:38:41,165 INFO L423 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:38:41,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:38:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -124840891, now seen corresponding path program 1 times [2018-11-18 12:38:41,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:38:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:38:41,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:41,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 1285 trivial. 0 not checked. [2018-11-18 12:38:41,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:38:41,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:38:41,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:41,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:38:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 419 proven. 155 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-18 12:38:42,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:38:42,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 38 [2018-11-18 12:38:42,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 12:38:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 12:38:42,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 12:38:42,344 INFO L87 Difference]: Start difference. First operand 15909 states and 18757 transitions. Second operand 38 states. [2018-11-18 12:38:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:38:57,437 INFO L93 Difference]: Finished difference Result 49872 states and 60276 transitions. [2018-11-18 12:38:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-11-18 12:38:57,437 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 470 [2018-11-18 12:38:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:38:57,503 INFO L225 Difference]: With dead ends: 49872 [2018-11-18 12:38:57,503 INFO L226 Difference]: Without dead ends: 35060 [2018-11-18 12:38:57,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 495 SyntacticMatches, 10 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18890 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3697, Invalid=47153, Unknown=0, NotChecked=0, Total=50850 [2018-11-18 12:38:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35060 states. [2018-11-18 12:38:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35060 to 21472. [2018-11-18 12:38:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21472 states. [2018-11-18 12:38:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21472 states to 21472 states and 25438 transitions. [2018-11-18 12:38:59,445 INFO L78 Accepts]: Start accepts. Automaton has 21472 states and 25438 transitions. Word has length 470 [2018-11-18 12:38:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:38:59,446 INFO L480 AbstractCegarLoop]: Abstraction has 21472 states and 25438 transitions. [2018-11-18 12:38:59,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 12:38:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21472 states and 25438 transitions. [2018-11-18 12:38:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-18 12:38:59,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:38:59,471 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:38:59,471 INFO L423 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:38:59,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:38:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash 19975153, now seen corresponding path program 1 times [2018-11-18 12:38:59,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:38:59,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:38:59,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:59,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:38:59,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:38:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:38:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 1285 trivial. 0 not checked. [2018-11-18 12:38:59,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:38:59,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:38:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:00,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:39:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 419 proven. 155 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-18 12:39:00,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:39:00,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-18 12:39:00,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 12:39:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 12:39:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 12:39:00,517 INFO L87 Difference]: Start difference. First operand 21472 states and 25438 transitions. Second operand 39 states. [2018-11-18 12:39:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:19,325 INFO L93 Difference]: Finished difference Result 67013 states and 81450 transitions. [2018-11-18 12:39:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-11-18 12:39:19,326 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 471 [2018-11-18 12:39:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:39:19,413 INFO L225 Difference]: With dead ends: 67013 [2018-11-18 12:39:19,413 INFO L226 Difference]: Without dead ends: 46895 [2018-11-18 12:39:19,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 495 SyntacticMatches, 9 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15591 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3320, Invalid=40152, Unknown=0, NotChecked=0, Total=43472 [2018-11-18 12:39:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46895 states. [2018-11-18 12:39:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46895 to 27201. [2018-11-18 12:39:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27201 states. [2018-11-18 12:39:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27201 states to 27201 states and 32262 transitions. [2018-11-18 12:39:21,923 INFO L78 Accepts]: Start accepts. Automaton has 27201 states and 32262 transitions. Word has length 471 [2018-11-18 12:39:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:39:21,924 INFO L480 AbstractCegarLoop]: Abstraction has 27201 states and 32262 transitions. [2018-11-18 12:39:21,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 12:39:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 27201 states and 32262 transitions. [2018-11-18 12:39:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-18 12:39:21,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:39:21,946 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:21,946 INFO L423 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:39:21,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash -379531277, now seen corresponding path program 1 times [2018-11-18 12:39:21,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:21,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2018-11-18 12:39:22,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:39:22,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:39:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:22,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:39:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 409 proven. 63 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-18 12:39:22,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:39:22,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2018-11-18 12:39:22,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:39:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:39:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:39:22,596 INFO L87 Difference]: Start difference. First operand 27201 states and 32262 transitions. Second operand 11 states. [2018-11-18 12:39:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:24,704 INFO L93 Difference]: Finished difference Result 44963 states and 53444 transitions. [2018-11-18 12:39:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:39:24,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 471 [2018-11-18 12:39:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:39:24,736 INFO L225 Difference]: With dead ends: 44963 [2018-11-18 12:39:24,736 INFO L226 Difference]: Without dead ends: 19102 [2018-11-18 12:39:24,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:39:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19102 states. [2018-11-18 12:39:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19102 to 19102. [2018-11-18 12:39:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19102 states. [2018-11-18 12:39:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19102 states to 19102 states and 22636 transitions. [2018-11-18 12:39:26,355 INFO L78 Accepts]: Start accepts. Automaton has 19102 states and 22636 transitions. Word has length 471 [2018-11-18 12:39:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:39:26,356 INFO L480 AbstractCegarLoop]: Abstraction has 19102 states and 22636 transitions. [2018-11-18 12:39:26,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:39:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 19102 states and 22636 transitions. [2018-11-18 12:39:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-18 12:39:26,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:39:26,370 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:26,370 INFO L423 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:39:26,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash 35323552, now seen corresponding path program 1 times [2018-11-18 12:39:26,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:26,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:26,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 68 proven. 48 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2018-11-18 12:39:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:39:26,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:39:26,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:26,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:39:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 404 proven. 161 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-18 12:39:27,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:39:27,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-18 12:39:27,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 12:39:27,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 12:39:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:39:27,015 INFO L87 Difference]: Start difference. First operand 19102 states and 22636 transitions. Second operand 18 states. [2018-11-18 12:39:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:33,382 INFO L93 Difference]: Finished difference Result 60190 states and 71704 transitions. [2018-11-18 12:39:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 12:39:33,383 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 471 [2018-11-18 12:39:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:39:33,469 INFO L225 Difference]: With dead ends: 60190 [2018-11-18 12:39:33,469 INFO L226 Difference]: Without dead ends: 42440 [2018-11-18 12:39:33,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 505 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2018-11-18 12:39:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42440 states. [2018-11-18 12:39:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42440 to 36224. [2018-11-18 12:39:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36224 states. [2018-11-18 12:39:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36224 states to 36224 states and 43063 transitions. [2018-11-18 12:39:36,828 INFO L78 Accepts]: Start accepts. Automaton has 36224 states and 43063 transitions. Word has length 471 [2018-11-18 12:39:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:39:36,829 INFO L480 AbstractCegarLoop]: Abstraction has 36224 states and 43063 transitions. [2018-11-18 12:39:36,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 12:39:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 36224 states and 43063 transitions. [2018-11-18 12:39:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-18 12:39:36,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:39:36,857 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:36,857 INFO L423 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:39:36,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1058165321, now seen corresponding path program 1 times [2018-11-18 12:39:36,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:36,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:36,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:36,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:36,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-18 12:39:37,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:39:37,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:39:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:37,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:39:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 455 proven. 111 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-18 12:39:38,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:39:38,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 43 [2018-11-18 12:39:38,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 12:39:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 12:39:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1674, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 12:39:38,125 INFO L87 Difference]: Start difference. First operand 36224 states and 43063 transitions. Second operand 43 states. [2018-11-18 12:40:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:03,428 INFO L93 Difference]: Finished difference Result 129910 states and 159527 transitions. [2018-11-18 12:40:03,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-11-18 12:40:03,429 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 471 [2018-11-18 12:40:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:03,602 INFO L225 Difference]: With dead ends: 129910 [2018-11-18 12:40:03,602 INFO L226 Difference]: Without dead ends: 95383 [2018-11-18 12:40:03,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 487 SyntacticMatches, 5 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20281 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4294, Invalid=52588, Unknown=0, NotChecked=0, Total=56882 [2018-11-18 12:40:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95383 states. [2018-11-18 12:40:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95383 to 55057. [2018-11-18 12:40:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55057 states. [2018-11-18 12:40:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55057 states to 55057 states and 65670 transitions. [2018-11-18 12:40:09,344 INFO L78 Accepts]: Start accepts. Automaton has 55057 states and 65670 transitions. Word has length 471 [2018-11-18 12:40:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:09,345 INFO L480 AbstractCegarLoop]: Abstraction has 55057 states and 65670 transitions. [2018-11-18 12:40:09,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 12:40:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 55057 states and 65670 transitions. [2018-11-18 12:40:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-18 12:40:09,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:09,386 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:09,386 INFO L423 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:09,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -840036132, now seen corresponding path program 1 times [2018-11-18 12:40:09,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:40:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:40:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:09,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-18 12:40:09,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:40:09,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:40:09,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:09,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:40:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 455 proven. 111 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-18 12:40:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:40:10,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 43 [2018-11-18 12:40:10,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 12:40:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 12:40:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1674, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 12:40:10,521 INFO L87 Difference]: Start difference. First operand 55057 states and 65670 transitions. Second operand 43 states. [2018-11-18 12:40:28,523 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 12:40:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:39,367 INFO L93 Difference]: Finished difference Result 185208 states and 227740 transitions. [2018-11-18 12:40:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-11-18 12:40:39,368 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 472 [2018-11-18 12:40:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:39,638 INFO L225 Difference]: With dead ends: 185208 [2018-11-18 12:40:39,639 INFO L226 Difference]: Without dead ends: 132321 [2018-11-18 12:40:39,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 488 SyntacticMatches, 5 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20272 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4294, Invalid=52588, Unknown=0, NotChecked=0, Total=56882 [2018-11-18 12:40:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132321 states. [2018-11-18 12:40:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132321 to 73335. [2018-11-18 12:40:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73335 states. [2018-11-18 12:40:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73335 states to 73335 states and 87537 transitions. [2018-11-18 12:40:47,883 INFO L78 Accepts]: Start accepts. Automaton has 73335 states and 87537 transitions. Word has length 472 [2018-11-18 12:40:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:47,884 INFO L480 AbstractCegarLoop]: Abstraction has 73335 states and 87537 transitions. [2018-11-18 12:40:47,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 12:40:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 73335 states and 87537 transitions. [2018-11-18 12:40:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-18 12:40:47,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:47,937 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:47,937 INFO L423 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:47,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:47,938 INFO L82 PathProgramCache]: Analyzing trace with hash -175319200, now seen corresponding path program 1 times [2018-11-18 12:40:47,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:40:47,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:40:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:47,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2018-11-18 12:40:48,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:40:48,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:40:48,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:48,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:40:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 428 proven. 67 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2018-11-18 12:40:48,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:40:48,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-18 12:40:48,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:40:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:40:48,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:40:48,732 INFO L87 Difference]: Start difference. First operand 73335 states and 87537 transitions. Second operand 13 states. [2018-11-18 12:40:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:54,983 INFO L93 Difference]: Finished difference Result 121787 states and 145298 transitions. [2018-11-18 12:40:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 12:40:54,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 472 [2018-11-18 12:40:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:55,095 INFO L225 Difference]: With dead ends: 121787 [2018-11-18 12:40:55,095 INFO L226 Difference]: Without dead ends: 50500 [2018-11-18 12:40:55,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-18 12:40:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50500 states. [2018-11-18 12:41:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50500 to 50036. [2018-11-18 12:41:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50036 states. [2018-11-18 12:41:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50036 states to 50036 states and 59251 transitions. [2018-11-18 12:41:01,046 INFO L78 Accepts]: Start accepts. Automaton has 50036 states and 59251 transitions. Word has length 472 [2018-11-18 12:41:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:41:01,046 INFO L480 AbstractCegarLoop]: Abstraction has 50036 states and 59251 transitions. [2018-11-18 12:41:01,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:41:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 50036 states and 59251 transitions. [2018-11-18 12:41:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-18 12:41:01,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:41:01,082 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:41:01,082 INFO L423 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:41:01,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:41:01,083 INFO L82 PathProgramCache]: Analyzing trace with hash 12528209, now seen corresponding path program 1 times [2018-11-18 12:41:01,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:41:01,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:41:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:41:01,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:41:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:41:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:41:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-11-18 12:41:01,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:41:01,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:41:01,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:41:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:41:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:41:01,235 INFO L87 Difference]: Start difference. First operand 50036 states and 59251 transitions. Second operand 11 states. [2018-11-18 12:41:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:41:16,353 INFO L93 Difference]: Finished difference Result 150656 states and 182794 transitions. [2018-11-18 12:41:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 12:41:16,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 471 [2018-11-18 12:41:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:41:16,579 INFO L225 Difference]: With dead ends: 150656 [2018-11-18 12:41:16,579 INFO L226 Difference]: Without dead ends: 102782 [2018-11-18 12:41:16,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 12:41:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102782 states. [2018-11-18 12:41:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102782 to 45935. [2018-11-18 12:41:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45935 states. [2018-11-18 12:41:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45935 states to 45935 states and 54654 transitions. [2018-11-18 12:41:22,182 INFO L78 Accepts]: Start accepts. Automaton has 45935 states and 54654 transitions. Word has length 471 [2018-11-18 12:41:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:41:22,182 INFO L480 AbstractCegarLoop]: Abstraction has 45935 states and 54654 transitions. [2018-11-18 12:41:22,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:41:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45935 states and 54654 transitions. [2018-11-18 12:41:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-11-18 12:41:22,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:41:22,219 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:41:22,220 INFO L423 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:41:22,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:41:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1649546433, now seen corresponding path program 1 times [2018-11-18 12:41:22,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:41:22,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:41:22,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:41:22,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:41:22,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:41:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:41:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2018-11-18 12:41:22,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:41:22,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:41:22,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:41:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:41:22,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:41:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-11-18 12:41:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:41:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2018-11-18 12:41:22,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:41:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:41:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:41:22,632 INFO L87 Difference]: Start difference. First operand 45935 states and 54654 transitions. Second operand 13 states. [2018-11-18 12:41:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:41:30,915 INFO L93 Difference]: Finished difference Result 111346 states and 132833 transitions. [2018-11-18 12:41:30,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 12:41:30,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 480 [2018-11-18 12:41:30,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:41:31,038 INFO L225 Difference]: With dead ends: 111346 [2018-11-18 12:41:31,038 INFO L226 Difference]: Without dead ends: 66901 [2018-11-18 12:41:31,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 477 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-18 12:41:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66901 states. [2018-11-18 12:41:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66901 to 44811. [2018-11-18 12:41:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44811 states. [2018-11-18 12:41:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44811 states to 44811 states and 51830 transitions. [2018-11-18 12:41:36,530 INFO L78 Accepts]: Start accepts. Automaton has 44811 states and 51830 transitions. Word has length 480 [2018-11-18 12:41:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:41:36,530 INFO L480 AbstractCegarLoop]: Abstraction has 44811 states and 51830 transitions. [2018-11-18 12:41:36,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:41:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 44811 states and 51830 transitions. [2018-11-18 12:41:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-11-18 12:41:36,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:41:36,565 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:41:36,565 INFO L423 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:41:36,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:41:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash -288813079, now seen corresponding path program 1 times [2018-11-18 12:41:36,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:41:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:41:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:41:36,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:41:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:41:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:41:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:41:36,846 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:41:37,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:41:37 BoogieIcfgContainer [2018-11-18 12:41:37,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:41:37,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:41:37,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:41:37,079 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:41:37,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:36:50" (3/4) ... [2018-11-18 12:41:37,081 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:41:37,334 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_42572eb5-bdd7-4d4f-b20d-24da9c78c9f2/bin-2019/uautomizer/witness.graphml [2018-11-18 12:41:37,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:41:37,335 INFO L168 Benchmark]: Toolchain (without parser) took 287718.59 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 958.6 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 923.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:41:37,335 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:41:37,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:41:37,336 INFO L168 Benchmark]: Boogie Preprocessor took 50.10 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:41:37,336 INFO L168 Benchmark]: RCFGBuilder took 910.14 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:41:37,336 INFO L168 Benchmark]: TraceAbstraction took 286127.19 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 782.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:41:37,336 INFO L168 Benchmark]: Witness Printer took 255.82 ms. Allocated memory is still 5.0 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:41:37,338 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.10 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 910.14 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 286127.19 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 782.3 MB. Max. memory is 11.5 GB. * Witness Printer took 255.82 ms. Allocated memory is still 5.0 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L81] _Bool gate1Failed ; [L82] _Bool gate2Failed ; [L83] _Bool gate3Failed ; [L88] _Bool gate1Failed_History_0 ; [L89] _Bool gate1Failed_History_1 ; [L90] _Bool gate1Failed_History_2 ; [L91] _Bool gate2Failed_History_0 ; [L92] _Bool gate2Failed_History_1 ; [L93] _Bool gate2Failed_History_2 ; [L94] _Bool gate3Failed_History_0 ; [L95] _Bool gate3Failed_History_1 ; [L96] _Bool gate3Failed_History_2 ; [L68] msg_t nomsg = (msg_t )-1; [L69] port_t g1v ; [L70] int8_t g1v_old ; [L71] int8_t g1v_new ; [L72] port_t g2v ; [L73] int8_t g2v_old ; [L74] int8_t g2v_new ; [L75] port_t g3v ; [L76] int8_t g3v_old ; [L77] int8_t g3v_new ; [L84] msg_t VALUE1 ; [L85] msg_t VALUE2 ; [L86] msg_t VALUE3 ; [L97] int8_t votedValue_History_0 ; [L98] int8_t votedValue_History_1 ; [L99] int8_t votedValue_History_2 ; [L519] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; VAL [\old(g1v)=292, \old(g1v_new)=288, \old(g1v_old)=281, \old(g2v)=268, \old(g2v_new)=261, \old(g2v_old)=287, \old(g3v)=273, \old(g3v_new)=280, \old(g3v_old)=276, \old(gate1Failed)=21, \old(gate1Failed_History_0)=30, \old(gate1Failed_History_1)=6, \old(gate1Failed_History_2)=4, \old(gate2Failed)=16, \old(gate2Failed_History_0)=19, \old(gate2Failed_History_1)=10, \old(gate2Failed_History_2)=35, \old(gate3Failed)=38, \old(gate3Failed_History_0)=33, \old(gate3Failed_History_1)=22, \old(gate3Failed_History_2)=13, \old(nomsg)=274, \old(VALUE1)=283, \old(VALUE2)=258, \old(VALUE3)=264, \old(votedValue_History_0)=263, \old(votedValue_History_1)=290, \old(votedValue_History_2)=270, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] gate1Failed = __VERIFIER_nondet_bool() [L528] gate2Failed = __VERIFIER_nondet_bool() [L529] gate3Failed = __VERIFIER_nondet_bool() [L530] VALUE1 = __VERIFIER_nondet_char() [L531] VALUE2 = __VERIFIER_nondet_char() [L532] VALUE3 = __VERIFIER_nondet_char() [L533] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L534] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L535] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L536] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L537] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L538] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L539] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L540] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L541] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L542] votedValue_History_0 = __VERIFIER_nondet_char() [L543] votedValue_History_1 = __VERIFIER_nondet_char() [L544] votedValue_History_2 = __VERIFIER_nondet_char() [L545] CALL, EXPR init() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L248] int tmp ; [L249] int tmp___0 ; [L250] int tmp___1 ; [L251] int tmp___2 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] CALL, EXPR add_history_type(0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] CALL, EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] RET return (gate1Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] CALL, EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] RET return (gate1Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] CALL, EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] RET return (gate1Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] EXPR add_history_type(0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] tmp = add_history_type(0) [L255] COND FALSE !(! tmp) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] CALL, EXPR add_history_type(1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] CALL, EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] RET return (gate2Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] CALL, EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] RET return (gate2Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] CALL, EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] RET return (gate2Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] EXPR add_history_type(1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] tmp___0 = add_history_type(1) [L259] COND FALSE !(! tmp___0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] CALL, EXPR add_history_type(2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] CALL, EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] RET return (gate3Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] CALL, EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] RET return (gate3Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] CALL, EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] RET return (gate3Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] EXPR add_history_type(2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] tmp___1 = add_history_type(2) [L263] COND FALSE !(! tmp___1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] CALL, EXPR add_history_type(3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] EXPR add_history_type(3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] tmp___2 = add_history_type(3) [L267] COND FALSE !(! tmp___2) [L270] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L545] EXPR init() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, init()=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L545] i2 = init() [L547] g1v_old = nomsg [L548] g1v_new = nomsg [L549] g2v_old = nomsg [L550] g2v_new = nomsg [L551] g3v_old = nomsg [L552] g3v_new = nomsg [L553] i2 = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L554] COND TRUE i2 < 10 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L556] CALL gate1_each_pals_period() VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L389] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] RET gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L389] write_history_bool(0, gate1Failed) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L390] COND TRUE \read(gate1Failed) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L391] COND FALSE, EXPR !(nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L391] RET g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L556] gate1_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L557] CALL gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=23, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L420] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] RET gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L420] write_history_bool(1, gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L421] COND TRUE \read(gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L422] COND FALSE, EXPR !(nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=23, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L422] RET g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L557] gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L558] CALL gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L451] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=11, gate3Failed_History_2=15, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] RET gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L451] write_history_bool(2, gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L452] COND FALSE !(\read(gate3Failed)) [L456] tmp = __VERIFIER_nondet_char() [L457] next_state = tmp VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L458] COND TRUE (int )next_state == 0 [L459] tmp___0 = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] COND TRUE, EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=9, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=11, \old(gate3Failed_History_2)=15, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, next_state=0, next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] RET g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L558] gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L559] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L515] CALL write_history_int8(3, voted_value) VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] RET votedValue_History_0 = buf VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=255, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L559] voter() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] g3v_new = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L566] CALL, EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! gate1Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L297] COND FALSE !(! gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] COND TRUE ! gate3Failed [L301] tmp = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L306] CALL, EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L172] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L175] COND TRUE historyIndex == 1 [L176] RET return (gate1Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L306] EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L308] CALL, EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L182] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L185] COND TRUE historyIndex == 1 [L186] RET return (gate2Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L308] EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L310] CALL, EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L192] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L195] COND TRUE historyIndex == 1 [L196] RET return (gate3Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L310] EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L313] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L313] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L317] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L317] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND TRUE (int )VALUE2 == (int )tmp___1 [L319] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L321] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L321] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND TRUE (int )VALUE3 == (int )tmp___2 [L323] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L325] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L339] COND FALSE !(! (temp_count > 1)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] CALL, EXPR read_history_int8(3, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L155] COND TRUE historyIndex == 1 [L156] RET return (votedValue_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] EXPR read_history_int8(3, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND FALSE !((int )tmp___10 > -2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] tmp___11 = read_history_int8(3, 0) [L366] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L566] EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, check()=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L566] c1 = check() [L567] CALL assert(c1) VAL [\old(arg)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L579] COND FALSE, RET !(! arg) VAL [\old(arg)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L567] assert(c1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L568] i2 ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L554] COND TRUE i2 < 10 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L556] CALL gate1_each_pals_period() VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L389] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] RET gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L389] write_history_bool(0, gate1Failed) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L396] COND TRUE (int )next_state == 0 [L397] tmp___0 = 1 VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] COND TRUE, EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, next_state=0, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] RET g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L556] gate1_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L557] CALL gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L420] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] RET gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L420] write_history_bool(1, gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L421] COND TRUE \read(gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] COND FALSE, EXPR !(nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] RET g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L557] gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L558] CALL gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L451] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=11, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] RET gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L451] write_history_bool(2, gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L452] COND TRUE \read(gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] COND FALSE, EXPR !(nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=11, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] RET g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L558] gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L559] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] CALL write_history_int8(3, voted_value) VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] RET votedValue_History_0 = buf VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, buf=255, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L515] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L559] voter() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] g3v_new = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] CALL, EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] RET return (gate1Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND FALSE !(! tmp___3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] CALL, EXPR read_history_int8(3, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L155] COND TRUE historyIndex == 1 [L156] RET return (votedValue_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] EXPR read_history_int8(3, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND TRUE (int )tmp___10 > -2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] tmp___6 = read_history_int8(3, 0) [L348] COND TRUE (int )tmp___6 == (int )nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] CALL, EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] RET return (gate1Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] tmp___7 = read_history_bool(0, 1) [L350] COND TRUE \read(tmp___7) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] CALL, EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L182] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L185] COND TRUE historyIndex == 1 [L186] RET return (gate2Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] tmp___8 = read_history_bool(1, 1) [L352] COND TRUE \read(tmp___8) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] CALL, EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L192] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L195] COND TRUE historyIndex == 1 [L196] RET return (gate3Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] tmp___9 = read_history_bool(2, 1) [L354] COND TRUE ! tmp___9 [L355] RET return (0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, check()=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] c1 = check() [L567] CALL assert(c1) VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L579] COND TRUE ! arg VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L581] __VERIFIER_error() VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 212 locations, 1 error locations. UNSAFE Result, 286.0s OverallTime, 50 OverallIterations, 16 TraceHistogramMax, 213.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21803 SDtfs, 41540 SDslu, 55020 SDs, 0 SdLazy, 301057 SolverSat, 19177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12301 GetRequests, 9762 SyntacticMatches, 90 SemanticMatches, 2449 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250615 ImplicationChecksByTransitivity, 46.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73335occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 47.3s AutomataMinimizationTime, 49 MinimizatonAttempts, 249245 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 23308 NumberOfCodeBlocks, 23308 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 22753 ConstructedInterpolants, 0 QuantifiedInterpolants, 22383743 SizeOfPredicates, 83 NumberOfNonLiveVariables, 42581 ConjunctsInSsa, 714 ConjunctsInUnsatCore, 73 InterpolantComputations, 34 PerfectInterpolantSequences, 54390/56716 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...