./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.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_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 077fe0fcd97be15aa2e10e89ce167f8b22d1af7e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:27:41,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:27:41,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:27:41,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:27:41,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:27:41,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:27:41,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:27:42,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:27:42,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:27:42,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:27:42,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:27:42,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:27:42,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:27:42,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:27:42,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:27:42,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:27:42,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:27:42,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:27:42,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:27:42,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:27:42,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:27:42,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:27:42,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:27:42,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:27:42,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:27:42,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:27:42,018 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:27:42,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:27:42,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:27:42,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:27:42,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:27:42,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:27:42,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:27:42,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:27:42,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:27:42,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:27:42,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 10:27:42,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:27:42,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:27:42,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:27:42,034 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 10:27:42,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:27:42,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:27:42,035 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:27:42,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:27:42,035 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:27:42,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:27:42,037 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:27:42,037 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:27:42,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:27:42,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:27:42,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:27:42,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:27:42,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:27:42,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:27:42,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:27:42,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:27:42,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:27:42,038 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:27:42,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:27:42,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:27:42,039 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_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 -> 077fe0fcd97be15aa2e10e89ce167f8b22d1af7e [2018-11-18 10:27:42,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:27:42,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:27:42,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:27:42,071 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:27:42,071 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:27:42,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-18 10:27:42,107 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/data/f46e4bb8a/452e03bfa03f481db5af537c1ef81d0b/FLAG6f69c11cb [2018-11-18 10:27:42,524 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:27:42,525 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-18 10:27:42,533 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/data/f46e4bb8a/452e03bfa03f481db5af537c1ef81d0b/FLAG6f69c11cb [2018-11-18 10:27:42,541 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/data/f46e4bb8a/452e03bfa03f481db5af537c1ef81d0b [2018-11-18 10:27:42,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:27:42,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:27:42,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:27:42,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:27:42,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:27:42,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42, skipping insertion in model container [2018-11-18 10:27:42,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:27:42,578 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:27:42,718 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:27:42,725 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:27:42,806 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:27:42,818 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:27:42,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42 WrapperNode [2018-11-18 10:27:42,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:27:42,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:27:42,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:27:42,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:27:42,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... [2018-11-18 10:27:42,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:27:42,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:27:42,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:27:42,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:27:42,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2018-11-18 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2018-11-18 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2018-11-18 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2018-11-18 10:27:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:27:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2018-11-18 10:27:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 10:27:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 10:27:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-18 10:27:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure read [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2018-11-18 10:27:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:27:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:27:43,373 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:27:43,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:27:43 BoogieIcfgContainer [2018-11-18 10:27:43,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:27:43,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:27:43,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:27:43,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:27:43,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:27:42" (1/3) ... [2018-11-18 10:27:43,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f90e33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:27:43, skipping insertion in model container [2018-11-18 10:27:43,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:42" (2/3) ... [2018-11-18 10:27:43,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f90e33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:27:43, skipping insertion in model container [2018-11-18 10:27:43,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:27:43" (3/3) ... [2018-11-18 10:27:43,381 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-18 10:27:43,389 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:27:43,397 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:27:43,410 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:27:43,438 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:27:43,439 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:27:43,439 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:27:43,439 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:27:43,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:27:43,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:27:43,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:27:43,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:27:43,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:27:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-11-18 10:27:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:27:43,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:43,465 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 10:27:43,467 INFO L423 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:43,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 825444053, now seen corresponding path program 1 times [2018-11-18 10:27:43,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:43,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:43,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:43,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:43,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:43,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:43,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:43,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:43,664 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-11-18 10:27:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:43,791 INFO L93 Difference]: Finished difference Result 414 states and 673 transitions. [2018-11-18 10:27:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:43,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 10:27:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:43,803 INFO L225 Difference]: With dead ends: 414 [2018-11-18 10:27:43,803 INFO L226 Difference]: Without dead ends: 213 [2018-11-18 10:27:43,807 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 10:27:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-18 10:27:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-11-18 10:27:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-18 10:27:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 313 transitions. [2018-11-18 10:27:43,846 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 313 transitions. Word has length 22 [2018-11-18 10:27:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:43,846 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 313 transitions. [2018-11-18 10:27:43,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 313 transitions. [2018-11-18 10:27:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:27:43,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:43,848 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 10:27:43,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:43,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1849404687, now seen corresponding path program 1 times [2018-11-18 10:27:43,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:43,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:43,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:43,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:43,920 INFO L87 Difference]: Start difference. First operand 211 states and 313 transitions. Second operand 4 states. [2018-11-18 10:27:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:43,989 INFO L93 Difference]: Finished difference Result 431 states and 645 transitions. [2018-11-18 10:27:43,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:43,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-18 10:27:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:43,991 INFO L225 Difference]: With dead ends: 431 [2018-11-18 10:27:43,991 INFO L226 Difference]: Without dead ends: 229 [2018-11-18 10:27:43,992 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 10:27:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-18 10:27:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-11-18 10:27:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-18 10:27:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2018-11-18 10:27:44,010 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 23 [2018-11-18 10:27:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,010 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2018-11-18 10:27:44,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2018-11-18 10:27:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 10:27:44,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,012 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 10:27:44,012 INFO L423 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1652791322, now seen corresponding path program 1 times [2018-11-18 10:27:44,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,063 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 10:27:44,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:27:44,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:27:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:27:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:27:44,064 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand 3 states. [2018-11-18 10:27:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,093 INFO L93 Difference]: Finished difference Result 466 states and 694 transitions. [2018-11-18 10:27:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:27:44,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 10:27:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,096 INFO L225 Difference]: With dead ends: 466 [2018-11-18 10:27:44,096 INFO L226 Difference]: Without dead ends: 257 [2018-11-18 10:27:44,097 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 10:27:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-18 10:27:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2018-11-18 10:27:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-18 10:27:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2018-11-18 10:27:44,113 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 32 [2018-11-18 10:27:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,113 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2018-11-18 10:27:44,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:27:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2018-11-18 10:27:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 10:27:44,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,115 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 10:27:44,115 INFO L423 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1730126729, now seen corresponding path program 1 times [2018-11-18 10:27:44,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,183 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 10:27:44,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:27:44,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:27:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:27:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:27:44,184 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand 5 states. [2018-11-18 10:27:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,238 INFO L93 Difference]: Finished difference Result 444 states and 653 transitions. [2018-11-18 10:27:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:44,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 10:27:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,241 INFO L225 Difference]: With dead ends: 444 [2018-11-18 10:27:44,241 INFO L226 Difference]: Without dead ends: 238 [2018-11-18 10:27:44,242 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 10:27:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-18 10:27:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2018-11-18 10:27:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-18 10:27:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2018-11-18 10:27:44,256 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 40 [2018-11-18 10:27:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,257 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2018-11-18 10:27:44,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:27:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2018-11-18 10:27:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 10:27:44,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,258 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 10:27:44,258 INFO L423 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,259 INFO L82 PathProgramCache]: Analyzing trace with hash -622392820, now seen corresponding path program 1 times [2018-11-18 10:27:44,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:44,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:44,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:44,314 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand 4 states. [2018-11-18 10:27:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,334 INFO L93 Difference]: Finished difference Result 402 states and 589 transitions. [2018-11-18 10:27:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:44,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-18 10:27:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,336 INFO L225 Difference]: With dead ends: 402 [2018-11-18 10:27:44,336 INFO L226 Difference]: Without dead ends: 230 [2018-11-18 10:27:44,337 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 10:27:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-18 10:27:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-11-18 10:27:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-18 10:27:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 330 transitions. [2018-11-18 10:27:44,348 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 330 transitions. Word has length 41 [2018-11-18 10:27:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,349 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 330 transitions. [2018-11-18 10:27:44,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 330 transitions. [2018-11-18 10:27:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:27:44,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,350 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 10:27:44,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -120920810, now seen corresponding path program 1 times [2018-11-18 10:27:44,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,407 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 10:27:44,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:44,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:44,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:44,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:44,409 INFO L87 Difference]: Start difference. First operand 230 states and 330 transitions. Second operand 4 states. [2018-11-18 10:27:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,466 INFO L93 Difference]: Finished difference Result 457 states and 665 transitions. [2018-11-18 10:27:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:44,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-18 10:27:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,468 INFO L225 Difference]: With dead ends: 457 [2018-11-18 10:27:44,468 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 10:27:44,469 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 10:27:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 10:27:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2018-11-18 10:27:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-18 10:27:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 352 transitions. [2018-11-18 10:27:44,481 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 352 transitions. Word has length 44 [2018-11-18 10:27:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,481 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 352 transitions. [2018-11-18 10:27:44,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 352 transitions. [2018-11-18 10:27:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:27:44,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,482 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 10:27:44,482 INFO L423 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 647292807, now seen corresponding path program 1 times [2018-11-18 10:27:44,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,533 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 10:27:44,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:44,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:44,534 INFO L87 Difference]: Start difference. First operand 249 states and 352 transitions. Second operand 4 states. [2018-11-18 10:27:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,568 INFO L93 Difference]: Finished difference Result 479 states and 695 transitions. [2018-11-18 10:27:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:44,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-18 10:27:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,570 INFO L225 Difference]: With dead ends: 479 [2018-11-18 10:27:44,571 INFO L226 Difference]: Without dead ends: 258 [2018-11-18 10:27:44,572 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 10:27:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-18 10:27:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-18 10:27:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-18 10:27:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2018-11-18 10:27:44,582 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 44 [2018-11-18 10:27:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,582 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2018-11-18 10:27:44,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2018-11-18 10:27:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:27:44,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,583 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 10:27:44,584 INFO L423 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1137107395, now seen corresponding path program 1 times [2018-11-18 10:27:44,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,639 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 10:27:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:27:44,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:27:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:27:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:27:44,640 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand 5 states. [2018-11-18 10:27:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,656 INFO L93 Difference]: Finished difference Result 477 states and 681 transitions. [2018-11-18 10:27:44,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:44,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-18 10:27:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,657 INFO L225 Difference]: With dead ends: 477 [2018-11-18 10:27:44,657 INFO L226 Difference]: Without dead ends: 258 [2018-11-18 10:27:44,658 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 10:27:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-18 10:27:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-18 10:27:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-18 10:27:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 359 transitions. [2018-11-18 10:27:44,667 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 359 transitions. Word has length 63 [2018-11-18 10:27:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,667 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 359 transitions. [2018-11-18 10:27:44,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:27:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 359 transitions. [2018-11-18 10:27:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 10:27:44,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,669 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 10:27:44,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1665225692, now seen corresponding path program 1 times [2018-11-18 10:27:44,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,713 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 10:27:44,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:44,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:44,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:44,715 INFO L87 Difference]: Start difference. First operand 256 states and 359 transitions. Second operand 4 states. [2018-11-18 10:27:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,750 INFO L93 Difference]: Finished difference Result 494 states and 706 transitions. [2018-11-18 10:27:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:44,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-18 10:27:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,752 INFO L225 Difference]: With dead ends: 494 [2018-11-18 10:27:44,752 INFO L226 Difference]: Without dead ends: 280 [2018-11-18 10:27:44,753 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 10:27:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-18 10:27:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-11-18 10:27:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-18 10:27:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 383 transitions. [2018-11-18 10:27:44,761 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 383 transitions. Word has length 67 [2018-11-18 10:27:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,762 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 383 transitions. [2018-11-18 10:27:44,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 383 transitions. [2018-11-18 10:27:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 10:27:44,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,763 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 10:27:44,763 INFO L423 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 433458435, now seen corresponding path program 1 times [2018-11-18 10:27:44,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,810 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 10:27:44,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:44,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:44,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:44,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:44,812 INFO L87 Difference]: Start difference. First operand 277 states and 383 transitions. Second operand 4 states. [2018-11-18 10:27:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,844 INFO L93 Difference]: Finished difference Result 503 states and 712 transitions. [2018-11-18 10:27:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:44,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-18 10:27:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,846 INFO L225 Difference]: With dead ends: 503 [2018-11-18 10:27:44,846 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 10:27:44,847 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 10:27:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 10:27:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-11-18 10:27:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-18 10:27:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2018-11-18 10:27:44,856 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 68 [2018-11-18 10:27:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,856 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2018-11-18 10:27:44,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2018-11-18 10:27:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 10:27:44,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,857 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 10:27:44,857 INFO L423 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1440948971, now seen corresponding path program 1 times [2018-11-18 10:27:44,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,905 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 10:27:44,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:27:44,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:27:44,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:27:44,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:27:44,906 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand 5 states. [2018-11-18 10:27:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:44,930 INFO L93 Difference]: Finished difference Result 489 states and 678 transitions. [2018-11-18 10:27:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:44,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-11-18 10:27:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:44,933 INFO L225 Difference]: With dead ends: 489 [2018-11-18 10:27:44,933 INFO L226 Difference]: Without dead ends: 273 [2018-11-18 10:27:44,934 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 10:27:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-18 10:27:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-11-18 10:27:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-18 10:27:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 368 transitions. [2018-11-18 10:27:44,941 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 368 transitions. Word has length 88 [2018-11-18 10:27:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:44,942 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 368 transitions. [2018-11-18 10:27:44,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:27:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 368 transitions. [2018-11-18 10:27:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 10:27:44,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:44,943 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 10:27:44,943 INFO L423 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:44,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash 830072500, now seen corresponding path program 1 times [2018-11-18 10:27:44,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:44,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:44,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:44,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:44,999 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 10:27:44,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:44,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:44,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:45,000 INFO L87 Difference]: Start difference. First operand 271 states and 368 transitions. Second operand 4 states. [2018-11-18 10:27:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,038 INFO L93 Difference]: Finished difference Result 477 states and 675 transitions. [2018-11-18 10:27:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:45,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-18 10:27:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,040 INFO L225 Difference]: With dead ends: 477 [2018-11-18 10:27:45,040 INFO L226 Difference]: Without dead ends: 269 [2018-11-18 10:27:45,040 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 10:27:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-18 10:27:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-18 10:27:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 10:27:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 364 transitions. [2018-11-18 10:27:45,046 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 364 transitions. Word has length 92 [2018-11-18 10:27:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,046 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 364 transitions. [2018-11-18 10:27:45,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 364 transitions. [2018-11-18 10:27:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 10:27:45,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,047 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 10:27:45,048 INFO L423 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1270772888, now seen corresponding path program 1 times [2018-11-18 10:27:45,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,090 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 10:27:45,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:45,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:45,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:45,215 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 10:27:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 10:27:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:27:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:27:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:27:45,233 INFO L87 Difference]: Start difference. First operand 269 states and 364 transitions. Second operand 6 states. [2018-11-18 10:27:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,348 INFO L93 Difference]: Finished difference Result 641 states and 879 transitions. [2018-11-18 10:27:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:27:45,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-11-18 10:27:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,350 INFO L225 Difference]: With dead ends: 641 [2018-11-18 10:27:45,350 INFO L226 Difference]: Without dead ends: 309 [2018-11-18 10:27:45,351 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 10:27:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-18 10:27:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-11-18 10:27:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-18 10:27:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 366 transitions. [2018-11-18 10:27:45,361 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 366 transitions. Word has length 109 [2018-11-18 10:27:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,361 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 366 transitions. [2018-11-18 10:27:45,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:27:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 366 transitions. [2018-11-18 10:27:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 10:27:45,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,363 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 10:27:45,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1892921050, now seen corresponding path program 1 times [2018-11-18 10:27:45,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,418 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 10:27:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:27:45,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:27:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:27:45,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:27:45,420 INFO L87 Difference]: Start difference. First operand 279 states and 366 transitions. Second operand 5 states. [2018-11-18 10:27:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,434 INFO L93 Difference]: Finished difference Result 450 states and 610 transitions. [2018-11-18 10:27:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:45,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-18 10:27:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,436 INFO L225 Difference]: With dead ends: 450 [2018-11-18 10:27:45,436 INFO L226 Difference]: Without dead ends: 279 [2018-11-18 10:27:45,437 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 10:27:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-18 10:27:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-18 10:27:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-18 10:27:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 364 transitions. [2018-11-18 10:27:45,443 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 364 transitions. Word has length 155 [2018-11-18 10:27:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,444 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 364 transitions. [2018-11-18 10:27:45,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:27:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 364 transitions. [2018-11-18 10:27:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 10:27:45,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,446 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 10:27:45,446 INFO L423 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1789641909, now seen corresponding path program 1 times [2018-11-18 10:27:45,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,500 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 10:27:45,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:45,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:45,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:45,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:45,501 INFO L87 Difference]: Start difference. First operand 279 states and 364 transitions. Second operand 4 states. [2018-11-18 10:27:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,527 INFO L93 Difference]: Finished difference Result 449 states and 610 transitions. [2018-11-18 10:27:45,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:45,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-11-18 10:27:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,529 INFO L225 Difference]: With dead ends: 449 [2018-11-18 10:27:45,529 INFO L226 Difference]: Without dead ends: 285 [2018-11-18 10:27:45,530 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 10:27:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-18 10:27:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-11-18 10:27:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 10:27:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 367 transitions. [2018-11-18 10:27:45,538 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 367 transitions. Word has length 174 [2018-11-18 10:27:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,538 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 367 transitions. [2018-11-18 10:27:45,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2018-11-18 10:27:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-18 10:27:45,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,540 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 10:27:45,540 INFO L423 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1471229060, now seen corresponding path program 1 times [2018-11-18 10:27:45,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,589 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 10:27:45,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:45,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:45,590 INFO L87 Difference]: Start difference. First operand 283 states and 367 transitions. Second operand 4 states. [2018-11-18 10:27:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,626 INFO L93 Difference]: Finished difference Result 458 states and 617 transitions. [2018-11-18 10:27:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:45,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-18 10:27:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,628 INFO L225 Difference]: With dead ends: 458 [2018-11-18 10:27:45,628 INFO L226 Difference]: Without dead ends: 290 [2018-11-18 10:27:45,629 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 10:27:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-18 10:27:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-11-18 10:27:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 10:27:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 371 transitions. [2018-11-18 10:27:45,637 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 371 transitions. Word has length 186 [2018-11-18 10:27:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,637 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 371 transitions. [2018-11-18 10:27:45,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 371 transitions. [2018-11-18 10:27:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 10:27:45,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,639 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 10:27:45,639 INFO L423 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash 770249110, now seen corresponding path program 1 times [2018-11-18 10:27:45,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,715 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 10:27:45,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:45,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:45,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:45,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:45,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:45,716 INFO L87 Difference]: Start difference. First operand 288 states and 371 transitions. Second operand 4 states. [2018-11-18 10:27:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,741 INFO L93 Difference]: Finished difference Result 460 states and 615 transitions. [2018-11-18 10:27:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:45,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-11-18 10:27:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,743 INFO L225 Difference]: With dead ends: 460 [2018-11-18 10:27:45,743 INFO L226 Difference]: Without dead ends: 287 [2018-11-18 10:27:45,744 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 10:27:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-18 10:27:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-18 10:27:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-18 10:27:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 366 transitions. [2018-11-18 10:27:45,751 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 366 transitions. Word has length 199 [2018-11-18 10:27:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,752 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 366 transitions. [2018-11-18 10:27:45,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 366 transitions. [2018-11-18 10:27:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 10:27:45,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,754 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] [2018-11-18 10:27:45,754 INFO L423 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1766087054, now seen corresponding path program 1 times [2018-11-18 10:27:45,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,840 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 10:27:45,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:45,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:45,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:45,842 INFO L87 Difference]: Start difference. First operand 287 states and 366 transitions. Second operand 4 states. [2018-11-18 10:27:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:45,863 INFO L93 Difference]: Finished difference Result 458 states and 605 transitions. [2018-11-18 10:27:45,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:45,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-18 10:27:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:45,866 INFO L225 Difference]: With dead ends: 458 [2018-11-18 10:27:45,866 INFO L226 Difference]: Without dead ends: 286 [2018-11-18 10:27:45,867 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 10:27:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-18 10:27:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-11-18 10:27:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-11-18 10:27:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 363 transitions. [2018-11-18 10:27:45,877 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 363 transitions. Word has length 213 [2018-11-18 10:27:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:45,877 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 363 transitions. [2018-11-18 10:27:45,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 363 transitions. [2018-11-18 10:27:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 10:27:45,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:45,880 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] [2018-11-18 10:27:45,880 INFO L423 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:45,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 615007881, now seen corresponding path program 1 times [2018-11-18 10:27:45,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:45,953 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 10:27:45,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:45,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:45,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:45,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:45,954 INFO L87 Difference]: Start difference. First operand 286 states and 363 transitions. Second operand 4 states. [2018-11-18 10:27:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:46,245 INFO L93 Difference]: Finished difference Result 778 states and 1041 transitions. [2018-11-18 10:27:46,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:46,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-18 10:27:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:46,250 INFO L225 Difference]: With dead ends: 778 [2018-11-18 10:27:46,250 INFO L226 Difference]: Without dead ends: 607 [2018-11-18 10:27:46,251 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 10:27:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-18 10:27:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 469. [2018-11-18 10:27:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-18 10:27:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 623 transitions. [2018-11-18 10:27:46,270 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 623 transitions. Word has length 213 [2018-11-18 10:27:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:46,270 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 623 transitions. [2018-11-18 10:27:46,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 623 transitions. [2018-11-18 10:27:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 10:27:46,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:46,274 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 10:27:46,274 INFO L423 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:46,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash -82635610, now seen corresponding path program 1 times [2018-11-18 10:27:46,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,373 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 10:27:46,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:46,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:46,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:46,374 INFO L87 Difference]: Start difference. First operand 469 states and 623 transitions. Second operand 4 states. [2018-11-18 10:27:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:46,557 INFO L93 Difference]: Finished difference Result 1188 states and 1631 transitions. [2018-11-18 10:27:46,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:46,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2018-11-18 10:27:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:46,561 INFO L225 Difference]: With dead ends: 1188 [2018-11-18 10:27:46,561 INFO L226 Difference]: Without dead ends: 834 [2018-11-18 10:27:46,563 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 10:27:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-11-18 10:27:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 818. [2018-11-18 10:27:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-18 10:27:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1101 transitions. [2018-11-18 10:27:46,598 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1101 transitions. Word has length 250 [2018-11-18 10:27:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:46,598 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1101 transitions. [2018-11-18 10:27:46,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1101 transitions. [2018-11-18 10:27:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-18 10:27:46,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:46,602 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 10:27:46,602 INFO L423 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:46,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1187847361, now seen corresponding path program 1 times [2018-11-18 10:27:46,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,709 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 10:27:46,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:46,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:46,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:46,710 INFO L87 Difference]: Start difference. First operand 818 states and 1101 transitions. Second operand 4 states. [2018-11-18 10:27:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:46,967 INFO L93 Difference]: Finished difference Result 2163 states and 2988 transitions. [2018-11-18 10:27:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:46,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-11-18 10:27:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:46,974 INFO L225 Difference]: With dead ends: 2163 [2018-11-18 10:27:46,974 INFO L226 Difference]: Without dead ends: 1487 [2018-11-18 10:27:46,976 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 10:27:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-11-18 10:27:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1124. [2018-11-18 10:27:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-11-18 10:27:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2018-11-18 10:27:47,036 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 251 [2018-11-18 10:27:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:47,036 INFO L480 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2018-11-18 10:27:47,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2018-11-18 10:27:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 10:27:47,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:47,041 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, 1] [2018-11-18 10:27:47,041 INFO L423 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:47,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash -257180575, now seen corresponding path program 1 times [2018-11-18 10:27:47,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,130 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 10:27:47,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:47,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:27:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:47,131 INFO L87 Difference]: Start difference. First operand 1124 states and 1527 transitions. Second operand 4 states. [2018-11-18 10:27:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:47,401 INFO L93 Difference]: Finished difference Result 3108 states and 4305 transitions. [2018-11-18 10:27:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:47,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-11-18 10:27:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:47,413 INFO L225 Difference]: With dead ends: 3108 [2018-11-18 10:27:47,413 INFO L226 Difference]: Without dead ends: 2126 [2018-11-18 10:27:47,416 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 10:27:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2018-11-18 10:27:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1413. [2018-11-18 10:27:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2018-11-18 10:27:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1931 transitions. [2018-11-18 10:27:47,511 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1931 transitions. Word has length 252 [2018-11-18 10:27:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:47,511 INFO L480 AbstractCegarLoop]: Abstraction has 1413 states and 1931 transitions. [2018-11-18 10:27:47,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1931 transitions. [2018-11-18 10:27:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 10:27:47,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:47,516 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, 1] [2018-11-18 10:27:47,517 INFO L423 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:47,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1793803423, now seen corresponding path program 1 times [2018-11-18 10:27:47,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,621 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 10:27:47,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:47,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:47,835 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 10:27:47,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-18 10:27:47,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:27:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:27:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:27:47,862 INFO L87 Difference]: Start difference. First operand 1413 states and 1931 transitions. Second operand 10 states. [2018-11-18 10:27:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:48,112 INFO L93 Difference]: Finished difference Result 2915 states and 4019 transitions. [2018-11-18 10:27:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:27:48,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 252 [2018-11-18 10:27:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:48,119 INFO L225 Difference]: With dead ends: 2915 [2018-11-18 10:27:48,119 INFO L226 Difference]: Without dead ends: 1444 [2018-11-18 10:27:48,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:27:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2018-11-18 10:27:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2018-11-18 10:27:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-11-18 10:27:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1924 transitions. [2018-11-18 10:27:48,196 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1924 transitions. Word has length 252 [2018-11-18 10:27:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:48,196 INFO L480 AbstractCegarLoop]: Abstraction has 1444 states and 1924 transitions. [2018-11-18 10:27:48,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:27:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1924 transitions. [2018-11-18 10:27:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-11-18 10:27:48,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:48,202 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, 1] [2018-11-18 10:27:48,202 INFO L423 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:48,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1864646498, now seen corresponding path program 1 times [2018-11-18 10:27:48,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:48,343 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 10:27:48,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:48,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:48,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:48,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:48,579 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 10:27:48,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:27:48,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-18 10:27:48,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:27:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:27:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:27:48,607 INFO L87 Difference]: Start difference. First operand 1444 states and 1924 transitions. Second operand 9 states. [2018-11-18 10:27:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:48,759 INFO L93 Difference]: Finished difference Result 2813 states and 3889 transitions. [2018-11-18 10:27:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:27:48,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 310 [2018-11-18 10:27:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:48,767 INFO L225 Difference]: With dead ends: 2813 [2018-11-18 10:27:48,767 INFO L226 Difference]: Without dead ends: 1503 [2018-11-18 10:27:48,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:27:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-11-18 10:27:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2018-11-18 10:27:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-11-18 10:27:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1969 transitions. [2018-11-18 10:27:48,850 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1969 transitions. Word has length 310 [2018-11-18 10:27:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:48,851 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1969 transitions. [2018-11-18 10:27:48,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:27:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1969 transitions. [2018-11-18 10:27:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-18 10:27:48,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:48,854 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, 1] [2018-11-18 10:27:48,854 INFO L423 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:48,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2094689355, now seen corresponding path program 1 times [2018-11-18 10:27:48,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:48,973 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 10:27:48,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:48,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:27:48,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:27:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:27:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:27:48,974 INFO L87 Difference]: Start difference. First operand 1503 states and 1969 transitions. Second operand 3 states. [2018-11-18 10:27:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:49,044 INFO L93 Difference]: Finished difference Result 2582 states and 3405 transitions. [2018-11-18 10:27:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:27:49,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2018-11-18 10:27:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:49,051 INFO L225 Difference]: With dead ends: 2582 [2018-11-18 10:27:49,051 INFO L226 Difference]: Without dead ends: 1197 [2018-11-18 10:27:49,055 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 10:27:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-18 10:27:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2018-11-18 10:27:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2018-11-18 10:27:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1556 transitions. [2018-11-18 10:27:49,125 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1556 transitions. Word has length 311 [2018-11-18 10:27:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:49,126 INFO L480 AbstractCegarLoop]: Abstraction has 1197 states and 1556 transitions. [2018-11-18 10:27:49,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:27:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1556 transitions. [2018-11-18 10:27:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-18 10:27:49,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:49,154 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, 1] [2018-11-18 10:27:49,154 INFO L423 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:49,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash 668357316, now seen corresponding path program 1 times [2018-11-18 10:27:49,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:49,347 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 10:27:49,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:49,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:49,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:49,699 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 10:27:49,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:27:49,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-18 10:27:49,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:27:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:27:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:27:49,726 INFO L87 Difference]: Start difference. First operand 1197 states and 1556 transitions. Second operand 14 states. [2018-11-18 10:27:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:49,934 INFO L93 Difference]: Finished difference Result 1259 states and 1664 transitions. [2018-11-18 10:27:49,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:27:49,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2018-11-18 10:27:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:49,940 INFO L225 Difference]: With dead ends: 1259 [2018-11-18 10:27:49,940 INFO L226 Difference]: Without dead ends: 1257 [2018-11-18 10:27:49,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:27:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-11-18 10:27:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1221. [2018-11-18 10:27:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2018-11-18 10:27:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1583 transitions. [2018-11-18 10:27:50,009 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1583 transitions. Word has length 311 [2018-11-18 10:27:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:50,009 INFO L480 AbstractCegarLoop]: Abstraction has 1221 states and 1583 transitions. [2018-11-18 10:27:50,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:27:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1583 transitions. [2018-11-18 10:27:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-18 10:27:50,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:50,013 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, 1] [2018-11-18 10:27:50,013 INFO L423 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:50,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -623564782, now seen corresponding path program 1 times [2018-11-18 10:27:50,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:50,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:50,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:50,302 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 10:27:50,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:50,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:50,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:50,728 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 10:27:50,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:50,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-11-18 10:27:50,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 10:27:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:27:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:27:50,756 INFO L87 Difference]: Start difference. First operand 1221 states and 1583 transitions. Second operand 21 states. [2018-11-18 10:27:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:54,433 INFO L93 Difference]: Finished difference Result 4400 states and 5870 transitions. [2018-11-18 10:27:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 10:27:54,433 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 319 [2018-11-18 10:27:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:54,444 INFO L225 Difference]: With dead ends: 4400 [2018-11-18 10:27:54,444 INFO L226 Difference]: Without dead ends: 3351 [2018-11-18 10:27:54,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 10:27:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2018-11-18 10:27:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 2918. [2018-11-18 10:27:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2918 states. [2018-11-18 10:27:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 3866 transitions. [2018-11-18 10:27:54,609 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 3866 transitions. Word has length 319 [2018-11-18 10:27:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:54,609 INFO L480 AbstractCegarLoop]: Abstraction has 2918 states and 3866 transitions. [2018-11-18 10:27:54,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 10:27:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3866 transitions. [2018-11-18 10:27:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-18 10:27:54,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:54,613 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, 1] [2018-11-18 10:27:54,614 INFO L423 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:54,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash 69536915, now seen corresponding path program 1 times [2018-11-18 10:27:54,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:54,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:54,738 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 10:27:54,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:54,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:54,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:54,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:54,919 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 10:27:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:27:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-18 10:27:54,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:27:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:27:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:27:54,936 INFO L87 Difference]: Start difference. First operand 2918 states and 3866 transitions. Second operand 4 states. [2018-11-18 10:27:55,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:55,055 INFO L93 Difference]: Finished difference Result 4624 states and 6009 transitions. [2018-11-18 10:27:55,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:55,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2018-11-18 10:27:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:55,065 INFO L225 Difference]: With dead ends: 4624 [2018-11-18 10:27:55,065 INFO L226 Difference]: Without dead ends: 2405 [2018-11-18 10:27:55,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 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 10:27:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-11-18 10:27:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2018-11-18 10:27:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2018-11-18 10:27:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3035 transitions. [2018-11-18 10:27:55,180 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3035 transitions. Word has length 319 [2018-11-18 10:27:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:55,181 INFO L480 AbstractCegarLoop]: Abstraction has 2405 states and 3035 transitions. [2018-11-18 10:27:55,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:27:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3035 transitions. [2018-11-18 10:27:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-18 10:27:55,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:55,185 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] [2018-11-18 10:27:55,185 INFO L423 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:55,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1387885378, now seen corresponding path program 1 times [2018-11-18 10:27:55,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-18 10:27:55,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:55,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:27:55,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:27:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:27:55,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:27:55,407 INFO L87 Difference]: Start difference. First operand 2405 states and 3035 transitions. Second operand 10 states. [2018-11-18 10:27:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:55,811 INFO L93 Difference]: Finished difference Result 5147 states and 6581 transitions. [2018-11-18 10:27:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 10:27:55,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 334 [2018-11-18 10:27:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:55,823 INFO L225 Difference]: With dead ends: 5147 [2018-11-18 10:27:55,823 INFO L226 Difference]: Without dead ends: 3660 [2018-11-18 10:27:55,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:27:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2018-11-18 10:27:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3320. [2018-11-18 10:27:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3320 states. [2018-11-18 10:27:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4232 transitions. [2018-11-18 10:27:55,988 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4232 transitions. Word has length 334 [2018-11-18 10:27:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:55,988 INFO L480 AbstractCegarLoop]: Abstraction has 3320 states and 4232 transitions. [2018-11-18 10:27:55,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:27:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4232 transitions. [2018-11-18 10:27:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-18 10:27:55,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:55,993 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] [2018-11-18 10:27:55,993 INFO L423 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:55,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 520572412, now seen corresponding path program 1 times [2018-11-18 10:27:55,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:55,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:56,150 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 10:27:56,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:56,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:56,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:56,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-18 10:27:56,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:27:56,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-18 10:27:56,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:27:56,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:27:56,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:27:56,408 INFO L87 Difference]: Start difference. First operand 3320 states and 4232 transitions. Second operand 14 states. [2018-11-18 10:27:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:58,464 INFO L93 Difference]: Finished difference Result 5918 states and 7493 transitions. [2018-11-18 10:27:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 10:27:58,464 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 334 [2018-11-18 10:27:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:27:58,474 INFO L225 Difference]: With dead ends: 5918 [2018-11-18 10:27:58,474 INFO L226 Difference]: Without dead ends: 3345 [2018-11-18 10:27:58,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 10:27:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2018-11-18 10:27:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 2681. [2018-11-18 10:27:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2681 states. [2018-11-18 10:27:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3296 transitions. [2018-11-18 10:27:58,615 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3296 transitions. Word has length 334 [2018-11-18 10:27:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:27:58,616 INFO L480 AbstractCegarLoop]: Abstraction has 2681 states and 3296 transitions. [2018-11-18 10:27:58,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:27:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3296 transitions. [2018-11-18 10:27:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-18 10:27:58,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:27:58,619 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 10:27:58,619 INFO L423 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:27:58,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1787398270, now seen corresponding path program 1 times [2018-11-18 10:27:58,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:58,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:58,774 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 10:27:58,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:58,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:27:58,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:58,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-18 10:27:59,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:27:59,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-18 10:27:59,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:27:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:27:59,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:27:59,079 INFO L87 Difference]: Start difference. First operand 2681 states and 3296 transitions. Second operand 14 states. [2018-11-18 10:28:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:01,004 INFO L93 Difference]: Finished difference Result 4935 states and 6081 transitions. [2018-11-18 10:28:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 10:28:01,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 335 [2018-11-18 10:28:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:01,013 INFO L225 Difference]: With dead ends: 4935 [2018-11-18 10:28:01,013 INFO L226 Difference]: Without dead ends: 2797 [2018-11-18 10:28:01,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 10:28:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2018-11-18 10:28:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2432. [2018-11-18 10:28:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2432 states. [2018-11-18 10:28:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 2957 transitions. [2018-11-18 10:28:01,138 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 2957 transitions. Word has length 335 [2018-11-18 10:28:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:01,138 INFO L480 AbstractCegarLoop]: Abstraction has 2432 states and 2957 transitions. [2018-11-18 10:28:01,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:28:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 2957 transitions. [2018-11-18 10:28:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-18 10:28:01,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:01,141 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] [2018-11-18 10:28:01,141 INFO L423 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:01,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1325466038, now seen corresponding path program 1 times [2018-11-18 10:28:01,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:01,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:01,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2018-11-18 10:28:01,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:01,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:01,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-18 10:28:01,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:01,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-11-18 10:28:01,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 10:28:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:28:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:28:01,609 INFO L87 Difference]: Start difference. First operand 2432 states and 2957 transitions. Second operand 21 states. [2018-11-18 10:28:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:07,104 INFO L93 Difference]: Finished difference Result 7706 states and 9626 transitions. [2018-11-18 10:28:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-18 10:28:07,104 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 340 [2018-11-18 10:28:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:07,118 INFO L225 Difference]: With dead ends: 7706 [2018-11-18 10:28:07,118 INFO L226 Difference]: Without dead ends: 5721 [2018-11-18 10:28:07,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=438, Invalid=4254, Unknown=0, NotChecked=0, Total=4692 [2018-11-18 10:28:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2018-11-18 10:28:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 2678. [2018-11-18 10:28:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2018-11-18 10:28:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 3206 transitions. [2018-11-18 10:28:07,304 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 3206 transitions. Word has length 340 [2018-11-18 10:28:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:07,304 INFO L480 AbstractCegarLoop]: Abstraction has 2678 states and 3206 transitions. [2018-11-18 10:28:07,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 10:28:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3206 transitions. [2018-11-18 10:28:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-18 10:28:07,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:07,307 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] [2018-11-18 10:28:07,307 INFO L423 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:07,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:07,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1263426424, now seen corresponding path program 1 times [2018-11-18 10:28:07,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:07,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:07,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:07,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:07,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:07,479 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 10:28:07,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:07,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:28:07,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:28:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:28:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:28:07,481 INFO L87 Difference]: Start difference. First operand 2678 states and 3206 transitions. Second operand 10 states. [2018-11-18 10:28:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:08,334 INFO L93 Difference]: Finished difference Result 6524 states and 7889 transitions. [2018-11-18 10:28:08,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 10:28:08,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 340 [2018-11-18 10:28:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:08,349 INFO L225 Difference]: With dead ends: 6524 [2018-11-18 10:28:08,349 INFO L226 Difference]: Without dead ends: 4317 [2018-11-18 10:28:08,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-18 10:28:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2018-11-18 10:28:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 2645. [2018-11-18 10:28:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-11-18 10:28:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3146 transitions. [2018-11-18 10:28:08,526 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3146 transitions. Word has length 340 [2018-11-18 10:28:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:08,527 INFO L480 AbstractCegarLoop]: Abstraction has 2645 states and 3146 transitions. [2018-11-18 10:28:08,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:28:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3146 transitions. [2018-11-18 10:28:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-18 10:28:08,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:08,530 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] [2018-11-18 10:28:08,530 INFO L423 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:08,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:08,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1656453434, now seen corresponding path program 1 times [2018-11-18 10:28:08,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:08,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:08,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:08,717 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 10:28:08,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:08,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:28:08,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:28:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:28:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:28:08,718 INFO L87 Difference]: Start difference. First operand 2645 states and 3146 transitions. Second operand 6 states. [2018-11-18 10:28:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:09,076 INFO L93 Difference]: Finished difference Result 5962 states and 7548 transitions. [2018-11-18 10:28:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:28:09,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2018-11-18 10:28:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:09,089 INFO L225 Difference]: With dead ends: 5962 [2018-11-18 10:28:09,089 INFO L226 Difference]: Without dead ends: 3869 [2018-11-18 10:28:09,093 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 10:28:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2018-11-18 10:28:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 2774. [2018-11-18 10:28:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2018-11-18 10:28:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3338 transitions. [2018-11-18 10:28:09,279 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3338 transitions. Word has length 340 [2018-11-18 10:28:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:09,279 INFO L480 AbstractCegarLoop]: Abstraction has 2774 states and 3338 transitions. [2018-11-18 10:28:09,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:28:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3338 transitions. [2018-11-18 10:28:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-18 10:28:09,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:09,285 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:09,285 INFO L423 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:09,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1749362312, now seen corresponding path program 1 times [2018-11-18 10:28:09,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:09,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:09,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2018-11-18 10:28:09,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:09,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:09,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:09,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 229 proven. 96 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-11-18 10:28:09,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:28:09,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-18 10:28:09,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 10:28:09,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 10:28:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-11-18 10:28:09,910 INFO L87 Difference]: Start difference. First operand 2774 states and 3338 transitions. Second operand 24 states. [2018-11-18 10:28:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:17,128 INFO L93 Difference]: Finished difference Result 10303 states and 12909 transitions. [2018-11-18 10:28:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-11-18 10:28:17,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 413 [2018-11-18 10:28:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:17,148 INFO L225 Difference]: With dead ends: 10303 [2018-11-18 10:28:17,148 INFO L226 Difference]: Without dead ends: 8081 [2018-11-18 10:28:17,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 438 SyntacticMatches, 4 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2231, Invalid=17229, Unknown=0, NotChecked=0, Total=19460 [2018-11-18 10:28:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8081 states. [2018-11-18 10:28:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8081 to 6710. [2018-11-18 10:28:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-18 10:28:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8111 transitions. [2018-11-18 10:28:17,604 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8111 transitions. Word has length 413 [2018-11-18 10:28:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:17,605 INFO L480 AbstractCegarLoop]: Abstraction has 6710 states and 8111 transitions. [2018-11-18 10:28:17,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 10:28:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8111 transitions. [2018-11-18 10:28:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-18 10:28:17,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:17,617 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, 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 10:28:17,617 INFO L423 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:17,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1040973977, now seen corresponding path program 1 times [2018-11-18 10:28:17,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:17,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:17,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2018-11-18 10:28:17,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:17,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:17,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:17,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2018-11-18 10:28:17,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-18 10:28:17,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:28:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:28:17,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:28:17,963 INFO L87 Difference]: Start difference. First operand 6710 states and 8111 transitions. Second operand 4 states. [2018-11-18 10:28:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:18,290 INFO L93 Difference]: Finished difference Result 13328 states and 16127 transitions. [2018-11-18 10:28:18,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:28:18,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 413 [2018-11-18 10:28:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:18,305 INFO L225 Difference]: With dead ends: 13328 [2018-11-18 10:28:18,306 INFO L226 Difference]: Without dead ends: 6646 [2018-11-18 10:28:18,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 414 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 10:28:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2018-11-18 10:28:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6646. [2018-11-18 10:28:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6646 states. [2018-11-18 10:28:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 7827 transitions. [2018-11-18 10:28:18,691 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 7827 transitions. Word has length 413 [2018-11-18 10:28:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:18,692 INFO L480 AbstractCegarLoop]: Abstraction has 6646 states and 7827 transitions. [2018-11-18 10:28:18,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:28:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 7827 transitions. [2018-11-18 10:28:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-18 10:28:18,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:18,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:18,702 INFO L423 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:18,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1273878881, now seen corresponding path program 1 times [2018-11-18 10:28:18,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:18,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:18,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2018-11-18 10:28:18,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:18,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:19,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:19,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 195 proven. 120 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-18 10:28:19,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:28:19,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-18 10:28:19,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 10:28:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 10:28:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-11-18 10:28:19,412 INFO L87 Difference]: Start difference. First operand 6646 states and 7827 transitions. Second operand 28 states. [2018-11-18 10:28:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:30,925 INFO L93 Difference]: Finished difference Result 18792 states and 22308 transitions. [2018-11-18 10:28:30,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-11-18 10:28:30,925 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 414 [2018-11-18 10:28:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:30,952 INFO L225 Difference]: With dead ends: 18792 [2018-11-18 10:28:30,952 INFO L226 Difference]: Without dead ends: 12826 [2018-11-18 10:28:30,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17344 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4499, Invalid=42373, Unknown=0, NotChecked=0, Total=46872 [2018-11-18 10:28:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12826 states. [2018-11-18 10:28:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12826 to 10073. [2018-11-18 10:28:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10073 states. [2018-11-18 10:28:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 11864 transitions. [2018-11-18 10:28:31,553 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 11864 transitions. Word has length 414 [2018-11-18 10:28:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:31,553 INFO L480 AbstractCegarLoop]: Abstraction has 10073 states and 11864 transitions. [2018-11-18 10:28:31,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 10:28:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 11864 transitions. [2018-11-18 10:28:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-18 10:28:31,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:31,564 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, 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] [2018-11-18 10:28:31,565 INFO L423 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:31,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:31,565 INFO L82 PathProgramCache]: Analyzing trace with hash -837886977, now seen corresponding path program 1 times [2018-11-18 10:28:31,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:31,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:31,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:31,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 34 proven. 280 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2018-11-18 10:28:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:31,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:31,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:32,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2018-11-18 10:28:32,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:32,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2018-11-18 10:28:32,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 10:28:32,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:28:32,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:28:32,183 INFO L87 Difference]: Start difference. First operand 10073 states and 11864 transitions. Second operand 21 states. [2018-11-18 10:28:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,750 INFO L93 Difference]: Finished difference Result 21510 states and 25292 transitions. [2018-11-18 10:28:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 10:28:34,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 423 [2018-11-18 10:28:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,772 INFO L225 Difference]: With dead ends: 21510 [2018-11-18 10:28:34,773 INFO L226 Difference]: Without dead ends: 11945 [2018-11-18 10:28:34,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2018-11-18 10:28:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-11-18 10:28:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 10132. [2018-11-18 10:28:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2018-11-18 10:28:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 11910 transitions. [2018-11-18 10:28:35,379 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 11910 transitions. Word has length 423 [2018-11-18 10:28:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:35,380 INFO L480 AbstractCegarLoop]: Abstraction has 10132 states and 11910 transitions. [2018-11-18 10:28:35,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 10:28:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 11910 transitions. [2018-11-18 10:28:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-18 10:28:35,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:35,390 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:28:35,390 INFO L423 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:35,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1992317665, now seen corresponding path program 1 times [2018-11-18 10:28:35,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:35,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-18 10:28:35,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:35,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:35,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:35,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 523 proven. 208 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-11-18 10:28:36,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:28:36,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25] total 36 [2018-11-18 10:28:36,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 10:28:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 10:28:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 10:28:36,400 INFO L87 Difference]: Start difference. First operand 10132 states and 11910 transitions. Second operand 36 states. [2018-11-18 10:28:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:44,068 INFO L93 Difference]: Finished difference Result 23503 states and 27771 transitions. [2018-11-18 10:28:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-18 10:28:44,068 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 434 [2018-11-18 10:28:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:44,088 INFO L225 Difference]: With dead ends: 23503 [2018-11-18 10:28:44,088 INFO L226 Difference]: Without dead ends: 14115 [2018-11-18 10:28:44,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 442 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4604 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1468, Invalid=13294, Unknown=0, NotChecked=0, Total=14762 [2018-11-18 10:28:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14115 states. [2018-11-18 10:28:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14115 to 10138. [2018-11-18 10:28:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10138 states. [2018-11-18 10:28:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10138 states to 10138 states and 11909 transitions. [2018-11-18 10:28:44,811 INFO L78 Accepts]: Start accepts. Automaton has 10138 states and 11909 transitions. Word has length 434 [2018-11-18 10:28:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:44,811 INFO L480 AbstractCegarLoop]: Abstraction has 10138 states and 11909 transitions. [2018-11-18 10:28:44,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 10:28:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 10138 states and 11909 transitions. [2018-11-18 10:28:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-11-18 10:28:44,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:44,821 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 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, 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] [2018-11-18 10:28:44,821 INFO L423 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:44,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1067504032, now seen corresponding path program 1 times [2018-11-18 10:28:44,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:44,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:44,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-11-18 10:28:45,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:45,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:45,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:45,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 627 proven. 238 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-18 10:28:45,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:28:45,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24] total 35 [2018-11-18 10:28:45,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 10:28:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 10:28:45,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 10:28:45,725 INFO L87 Difference]: Start difference. First operand 10138 states and 11909 transitions. Second operand 35 states. [2018-11-18 10:28:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:53,675 INFO L93 Difference]: Finished difference Result 23494 states and 27753 transitions. [2018-11-18 10:28:53,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-18 10:28:53,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 446 [2018-11-18 10:28:53,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:53,698 INFO L225 Difference]: With dead ends: 23494 [2018-11-18 10:28:53,698 INFO L226 Difference]: Without dead ends: 14106 [2018-11-18 10:28:53,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 452 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4788 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1412, Invalid=13594, Unknown=0, NotChecked=0, Total=15006 [2018-11-18 10:28:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14106 states. [2018-11-18 10:28:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14106 to 10133. [2018-11-18 10:28:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10133 states. [2018-11-18 10:28:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10133 states to 10133 states and 11897 transitions. [2018-11-18 10:28:54,470 INFO L78 Accepts]: Start accepts. Automaton has 10133 states and 11897 transitions. Word has length 446 [2018-11-18 10:28:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:54,470 INFO L480 AbstractCegarLoop]: Abstraction has 10133 states and 11897 transitions. [2018-11-18 10:28:54,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 10:28:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10133 states and 11897 transitions. [2018-11-18 10:28:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-18 10:28:54,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:54,479 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, 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 10:28:54,479 INFO L423 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:54,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash -183645274, now seen corresponding path program 1 times [2018-11-18 10:28:54,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:54,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:54,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2018-11-18 10:28:54,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:54,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:54,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:54,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 409 proven. 63 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2018-11-18 10:28:54,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:28:54,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2018-11-18 10:28:54,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:28:54,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:28:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:28:54,953 INFO L87 Difference]: Start difference. First operand 10133 states and 11897 transitions. Second operand 11 states. [2018-11-18 10:28:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:55,844 INFO L93 Difference]: Finished difference Result 14645 states and 17200 transitions. [2018-11-18 10:28:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 10:28:55,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 472 [2018-11-18 10:28:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:55,854 INFO L225 Difference]: With dead ends: 14645 [2018-11-18 10:28:55,854 INFO L226 Difference]: Without dead ends: 5177 [2018-11-18 10:28:55,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 465 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 10:28:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2018-11-18 10:28:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 5177. [2018-11-18 10:28:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2018-11-18 10:28:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 6035 transitions. [2018-11-18 10:28:56,186 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 6035 transitions. Word has length 472 [2018-11-18 10:28:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:56,187 INFO L480 AbstractCegarLoop]: Abstraction has 5177 states and 6035 transitions. [2018-11-18 10:28:56,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:28:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 6035 transitions. [2018-11-18 10:28:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-18 10:28:56,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:56,192 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, 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] [2018-11-18 10:28:56,192 INFO L423 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:56,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash 134301807, now seen corresponding path program 1 times [2018-11-18 10:28:56,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:56,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-11-18 10:28:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:56,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:28:56,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:28:56,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:28:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:28:56,540 INFO L87 Difference]: Start difference. First operand 5177 states and 6035 transitions. Second operand 10 states. [2018-11-18 10:28:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:57,413 INFO L93 Difference]: Finished difference Result 11328 states and 13529 transitions. [2018-11-18 10:28:57,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 10:28:57,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 470 [2018-11-18 10:28:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:57,424 INFO L225 Difference]: With dead ends: 11328 [2018-11-18 10:28:57,424 INFO L226 Difference]: Without dead ends: 6879 [2018-11-18 10:28:57,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-11-18 10:28:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6879 states. [2018-11-18 10:28:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6879 to 5229. [2018-11-18 10:28:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5229 states. [2018-11-18 10:28:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 6143 transitions. [2018-11-18 10:28:57,786 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 6143 transitions. Word has length 470 [2018-11-18 10:28:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:57,787 INFO L480 AbstractCegarLoop]: Abstraction has 5229 states and 6143 transitions. [2018-11-18 10:28:57,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:28:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 6143 transitions. [2018-11-18 10:28:57,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-18 10:28:57,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:57,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:57,791 INFO L423 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:57,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1584804319, now seen corresponding path program 1 times [2018-11-18 10:28:57,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:28:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:28:57,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:57,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2018-11-18 10:28:58,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:58,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:28:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:58,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 409 proven. 4 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2018-11-18 10:28:58,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:28:58,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2018-11-18 10:28:58,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 10:28:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 10:28:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-11-18 10:28:58,507 INFO L87 Difference]: Start difference. First operand 5229 states and 6143 transitions. Second operand 22 states. [2018-11-18 10:29:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:00,275 INFO L93 Difference]: Finished difference Result 10025 states and 11822 transitions. [2018-11-18 10:29:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 10:29:00,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 471 [2018-11-18 10:29:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:00,283 INFO L225 Difference]: With dead ends: 10025 [2018-11-18 10:29:00,283 INFO L226 Difference]: Without dead ends: 5285 [2018-11-18 10:29:00,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 476 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 10:29:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2018-11-18 10:29:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 5245. [2018-11-18 10:29:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5245 states. [2018-11-18 10:29:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 6155 transitions. [2018-11-18 10:29:00,652 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 6155 transitions. Word has length 471 [2018-11-18 10:29:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:00,652 INFO L480 AbstractCegarLoop]: Abstraction has 5245 states and 6155 transitions. [2018-11-18 10:29:00,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 10:29:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 6155 transitions. [2018-11-18 10:29:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-18 10:29:00,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:00,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:00,658 INFO L423 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:00,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1060778943, now seen corresponding path program 1 times [2018-11-18 10:29:00,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:00,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:00,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-11-18 10:29:00,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:00,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:29:00,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:01,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:29:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 404 proven. 162 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-18 10:29:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:29:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-11-18 10:29:01,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 10:29:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 10:29:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1120, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 10:29:01,430 INFO L87 Difference]: Start difference. First operand 5245 states and 6155 transitions. Second operand 35 states. [2018-11-18 10:29:27,871 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 10:29:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:36,954 INFO L93 Difference]: Finished difference Result 40973 states and 49223 transitions. [2018-11-18 10:29:36,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 558 states. [2018-11-18 10:29:36,954 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 472 [2018-11-18 10:29:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:37,011 INFO L225 Difference]: With dead ends: 40973 [2018-11-18 10:29:37,011 INFO L226 Difference]: Without dead ends: 36460 [2018-11-18 10:29:37,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 616 SyntacticMatches, 2 SemanticMatches, 589 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153092 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=17779, Invalid=330911, Unknown=0, NotChecked=0, Total=348690 [2018-11-18 10:29:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36460 states. [2018-11-18 10:29:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36460 to 12933. [2018-11-18 10:29:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12933 states. [2018-11-18 10:29:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12933 states to 12933 states and 15098 transitions. [2018-11-18 10:29:38,259 INFO L78 Accepts]: Start accepts. Automaton has 12933 states and 15098 transitions. Word has length 472 [2018-11-18 10:29:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:38,260 INFO L480 AbstractCegarLoop]: Abstraction has 12933 states and 15098 transitions. [2018-11-18 10:29:38,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 10:29:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 12933 states and 15098 transitions. [2018-11-18 10:29:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-18 10:29:38,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:38,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:38,275 INFO L423 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:38,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash -307675348, now seen corresponding path program 1 times [2018-11-18 10:29:38,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:38,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:38,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2018-11-18 10:29:38,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:38,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:29:38,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:38,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:29:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 519 proven. 36 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-11-18 10:29:39,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:29:39,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2018-11-18 10:29:39,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 10:29:39,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 10:29:39,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:29:39,104 INFO L87 Difference]: Start difference. First operand 12933 states and 15098 transitions. Second operand 25 states. [2018-11-18 10:29:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:43,906 INFO L93 Difference]: Finished difference Result 31795 states and 37308 transitions. [2018-11-18 10:29:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 10:29:43,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 472 [2018-11-18 10:29:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:43,952 INFO L225 Difference]: With dead ends: 31795 [2018-11-18 10:29:43,952 INFO L226 Difference]: Without dead ends: 19799 [2018-11-18 10:29:43,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=492, Invalid=2588, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 10:29:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19799 states. [2018-11-18 10:29:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19799 to 12933. [2018-11-18 10:29:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12933 states. [2018-11-18 10:29:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12933 states to 12933 states and 15098 transitions. [2018-11-18 10:29:45,143 INFO L78 Accepts]: Start accepts. Automaton has 12933 states and 15098 transitions. Word has length 472 [2018-11-18 10:29:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:45,144 INFO L480 AbstractCegarLoop]: Abstraction has 12933 states and 15098 transitions. [2018-11-18 10:29:45,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 10:29:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12933 states and 15098 transitions. [2018-11-18 10:29:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-11-18 10:29:45,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:45,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:45,162 INFO L423 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:45,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash -349803106, now seen corresponding path program 1 times [2018-11-18 10:29:45,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:45,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:45,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:45,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:45,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2018-11-18 10:29:45,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:45,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:29:45,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:45,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:29:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 519 proven. 36 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-11-18 10:29:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:29:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-11-18 10:29:46,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 10:29:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 10:29:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-11-18 10:29:46,027 INFO L87 Difference]: Start difference. First operand 12933 states and 15098 transitions. Second operand 26 states. [2018-11-18 10:29:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:50,475 INFO L93 Difference]: Finished difference Result 31775 states and 37288 transitions. [2018-11-18 10:29:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 10:29:50,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 473 [2018-11-18 10:29:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:50,510 INFO L225 Difference]: With dead ends: 31775 [2018-11-18 10:29:50,510 INFO L226 Difference]: Without dead ends: 19779 [2018-11-18 10:29:50,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 10:29:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19779 states. [2018-11-18 10:29:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19779 to 12919. [2018-11-18 10:29:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12919 states. [2018-11-18 10:29:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12919 states to 12919 states and 15084 transitions. [2018-11-18 10:29:51,818 INFO L78 Accepts]: Start accepts. Automaton has 12919 states and 15084 transitions. Word has length 473 [2018-11-18 10:29:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:51,818 INFO L480 AbstractCegarLoop]: Abstraction has 12919 states and 15084 transitions. [2018-11-18 10:29:51,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 10:29:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12919 states and 15084 transitions. [2018-11-18 10:29:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-11-18 10:29:51,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:51,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:51,829 INFO L423 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:51,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1452332764, now seen corresponding path program 1 times [2018-11-18 10:29:51,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:51,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-18 10:29:51,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:51,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:29:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:52,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:29:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 428 proven. 67 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-18 10:29:52,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:29:52,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-18 10:29:52,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:29:52,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:29:52,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:29:52,281 INFO L87 Difference]: Start difference. First operand 12919 states and 15084 transitions. Second operand 13 states. [2018-11-18 10:29:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:53,901 INFO L93 Difference]: Finished difference Result 19654 states and 22988 transitions. [2018-11-18 10:29:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 10:29:53,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 473 [2018-11-18 10:29:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:53,914 INFO L225 Difference]: With dead ends: 19654 [2018-11-18 10:29:53,914 INFO L226 Difference]: Without dead ends: 7289 [2018-11-18 10:29:53,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 467 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 10:29:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7289 states. [2018-11-18 10:29:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7289 to 7237. [2018-11-18 10:29:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7237 states. [2018-11-18 10:29:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 8432 transitions. [2018-11-18 10:29:54,623 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 8432 transitions. Word has length 473 [2018-11-18 10:29:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:54,623 INFO L480 AbstractCegarLoop]: Abstraction has 7237 states and 8432 transitions. [2018-11-18 10:29:54,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:29:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 8432 transitions. [2018-11-18 10:29:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-18 10:29:54,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:54,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:54,629 INFO L423 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1289918935, now seen corresponding path program 1 times [2018-11-18 10:29:54,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:54,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:54,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1293 trivial. 0 not checked. [2018-11-18 10:29:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:29:54,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:29:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:29:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:29:54,772 INFO L87 Difference]: Start difference. First operand 7237 states and 8432 transitions. Second operand 11 states. [2018-11-18 10:29:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:56,642 INFO L93 Difference]: Finished difference Result 15959 states and 19002 transitions. [2018-11-18 10:29:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 10:29:56,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 472 [2018-11-18 10:29:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:56,657 INFO L225 Difference]: With dead ends: 15959 [2018-11-18 10:29:56,657 INFO L226 Difference]: Without dead ends: 9431 [2018-11-18 10:29:56,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 10:29:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9431 states. [2018-11-18 10:29:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9431 to 5342. [2018-11-18 10:29:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5342 states. [2018-11-18 10:29:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 6149 transitions. [2018-11-18 10:29:57,262 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 6149 transitions. Word has length 472 [2018-11-18 10:29:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:57,263 INFO L480 AbstractCegarLoop]: Abstraction has 5342 states and 6149 transitions. [2018-11-18 10:29:57,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:29:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 6149 transitions. [2018-11-18 10:29:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-11-18 10:29:57,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:57,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:57,268 INFO L423 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:57,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash 842987676, now seen corresponding path program 1 times [2018-11-18 10:29:57,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:57,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:57,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2018-11-18 10:29:57,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:57,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:29:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:57,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:29:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2018-11-18 10:29:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:29:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2018-11-18 10:29:57,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:29:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:29:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:29:57,671 INFO L87 Difference]: Start difference. First operand 5342 states and 6149 transitions. Second operand 13 states. [2018-11-18 10:29:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:59,076 INFO L93 Difference]: Finished difference Result 12727 states and 14823 transitions. [2018-11-18 10:29:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 10:29:59,077 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 481 [2018-11-18 10:29:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:59,088 INFO L225 Difference]: With dead ends: 12727 [2018-11-18 10:29:59,089 INFO L226 Difference]: Without dead ends: 8094 [2018-11-18 10:29:59,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 478 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-18 10:29:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8094 states. [2018-11-18 10:29:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8094 to 5202. [2018-11-18 10:29:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2018-11-18 10:29:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 5925 transitions. [2018-11-18 10:29:59,774 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 5925 transitions. Word has length 481 [2018-11-18 10:29:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:59,775 INFO L480 AbstractCegarLoop]: Abstraction has 5202 states and 5925 transitions. [2018-11-18 10:29:59,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:29:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 5925 transitions. [2018-11-18 10:29:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-11-18 10:29:59,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:59,779 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, 1] [2018-11-18 10:29:59,779 INFO L423 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:59,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash 780948062, now seen corresponding path program 1 times [2018-11-18 10:29:59,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:29:59,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:29:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:59,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2018-11-18 10:29:59,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:59,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:29:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:00,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-11-18 10:30:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:30:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2018-11-18 10:30:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:30:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:30:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:30:00,157 INFO L87 Difference]: Start difference. First operand 5202 states and 5925 transitions. Second operand 14 states. [2018-11-18 10:30:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:02,314 INFO L93 Difference]: Finished difference Result 14791 states and 17177 transitions. [2018-11-18 10:30:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 10:30:02,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 481 [2018-11-18 10:30:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:02,329 INFO L225 Difference]: With dead ends: 14791 [2018-11-18 10:30:02,330 INFO L226 Difference]: Without dead ends: 10318 [2018-11-18 10:30:02,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 482 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-11-18 10:30:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10318 states. [2018-11-18 10:30:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10318 to 5294. [2018-11-18 10:30:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2018-11-18 10:30:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 5921 transitions. [2018-11-18 10:30:02,954 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 5921 transitions. Word has length 481 [2018-11-18 10:30:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:02,954 INFO L480 AbstractCegarLoop]: Abstraction has 5294 states and 5921 transitions. [2018-11-18 10:30:02,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:30:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 5921 transitions. [2018-11-18 10:30:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-18 10:30:02,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:02,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:02,959 INFO L423 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:02,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1292886379, now seen corresponding path program 1 times [2018-11-18 10:30:02,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:02,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:02,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 59 proven. 72 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2018-11-18 10:30:03,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:03,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/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 10:30:03,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:03,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 533 proven. 98 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2018-11-18 10:30:03,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:03,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-18 10:30:03,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 10:30:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 10:30:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:30:03,585 INFO L87 Difference]: Start difference. First operand 5294 states and 5921 transitions. Second operand 18 states. [2018-11-18 10:30:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:06,612 INFO L93 Difference]: Finished difference Result 8461 states and 9524 transitions. [2018-11-18 10:30:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 10:30:06,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 483 [2018-11-18 10:30:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:06,619 INFO L225 Difference]: With dead ends: 8461 [2018-11-18 10:30:06,619 INFO L226 Difference]: Without dead ends: 3916 [2018-11-18 10:30:06,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 490 SyntacticMatches, 22 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=3267, Unknown=0, NotChecked=0, Total=3782 [2018-11-18 10:30:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2018-11-18 10:30:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3593. [2018-11-18 10:30:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3593 states. [2018-11-18 10:30:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 3996 transitions. [2018-11-18 10:30:07,089 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 3996 transitions. Word has length 483 [2018-11-18 10:30:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:07,090 INFO L480 AbstractCegarLoop]: Abstraction has 3593 states and 3996 transitions. [2018-11-18 10:30:07,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 10:30:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 3996 transitions. [2018-11-18 10:30:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-18 10:30:07,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:07,094 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, 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 10:30:07,094 INFO L423 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:07,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1703524186, now seen corresponding path program 1 times [2018-11-18 10:30:07,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2018-11-18 10:30:07,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:07,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:07,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:07,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 471 proven. 9 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-18 10:30:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 25 [2018-11-18 10:30:07,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 10:30:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 10:30:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:30:07,877 INFO L87 Difference]: Start difference. First operand 3593 states and 3996 transitions. Second operand 25 states. [2018-11-18 10:30:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:10,118 INFO L93 Difference]: Finished difference Result 6867 states and 7671 transitions. [2018-11-18 10:30:10,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 10:30:10,118 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 483 [2018-11-18 10:30:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:10,124 INFO L225 Difference]: With dead ends: 6867 [2018-11-18 10:30:10,124 INFO L226 Difference]: Without dead ends: 3693 [2018-11-18 10:30:10,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 485 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=2465, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 10:30:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2018-11-18 10:30:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 3623. [2018-11-18 10:30:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2018-11-18 10:30:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4021 transitions. [2018-11-18 10:30:10,610 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4021 transitions. Word has length 483 [2018-11-18 10:30:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:10,610 INFO L480 AbstractCegarLoop]: Abstraction has 3623 states and 4021 transitions. [2018-11-18 10:30:10,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 10:30:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4021 transitions. [2018-11-18 10:30:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-18 10:30:10,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:10,614 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, 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 10:30:10,614 INFO L423 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:10,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1331666820, now seen corresponding path program 1 times [2018-11-18 10:30:10,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:10,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:10,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:10,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:10,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2018-11-18 10:30:10,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:10,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:10,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:11,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 538 proven. 89 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2018-11-18 10:30:11,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:11,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-18 10:30:11,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 10:30:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 10:30:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 10:30:11,524 INFO L87 Difference]: Start difference. First operand 3623 states and 4021 transitions. Second operand 39 states. [2018-11-18 10:30:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:25,639 INFO L93 Difference]: Finished difference Result 14943 states and 17514 transitions. [2018-11-18 10:30:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-18 10:30:25,639 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 484 [2018-11-18 10:30:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:25,662 INFO L225 Difference]: With dead ends: 14943 [2018-11-18 10:30:25,662 INFO L226 Difference]: Without dead ends: 12075 [2018-11-18 10:30:25,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10188 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2895, Invalid=28257, Unknown=0, NotChecked=0, Total=31152 [2018-11-18 10:30:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12075 states. [2018-11-18 10:30:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12075 to 4996. [2018-11-18 10:30:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2018-11-18 10:30:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 5569 transitions. [2018-11-18 10:30:26,413 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 5569 transitions. Word has length 484 [2018-11-18 10:30:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:26,413 INFO L480 AbstractCegarLoop]: Abstraction has 4996 states and 5569 transitions. [2018-11-18 10:30:26,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 10:30:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 5569 transitions. [2018-11-18 10:30:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-18 10:30:26,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:26,417 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, 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 10:30:26,417 INFO L423 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:26,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash 404915651, now seen corresponding path program 1 times [2018-11-18 10:30:26,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:26,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:26,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2018-11-18 10:30:26,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:26,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:26,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:26,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 538 proven. 89 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2018-11-18 10:30:27,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:27,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-18 10:30:27,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 10:30:27,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 10:30:27,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 10:30:27,352 INFO L87 Difference]: Start difference. First operand 4996 states and 5569 transitions. Second operand 39 states. [2018-11-18 10:30:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:40,999 INFO L93 Difference]: Finished difference Result 19208 states and 22556 transitions. [2018-11-18 10:30:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-18 10:30:40,999 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 485 [2018-11-18 10:30:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:41,018 INFO L225 Difference]: With dead ends: 19208 [2018-11-18 10:30:41,018 INFO L226 Difference]: Without dead ends: 15080 [2018-11-18 10:30:41,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10186 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2895, Invalid=28257, Unknown=0, NotChecked=0, Total=31152 [2018-11-18 10:30:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15080 states. [2018-11-18 10:30:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15080 to 6098. [2018-11-18 10:30:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6098 states. [2018-11-18 10:30:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 6796 transitions. [2018-11-18 10:30:41,889 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 6796 transitions. Word has length 485 [2018-11-18 10:30:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:41,889 INFO L480 AbstractCegarLoop]: Abstraction has 6098 states and 6796 transitions. [2018-11-18 10:30:41,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 10:30:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 6796 transitions. [2018-11-18 10:30:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-18 10:30:41,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:41,894 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, 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 10:30:41,894 INFO L423 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:41,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2029135489, now seen corresponding path program 1 times [2018-11-18 10:30:41,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:41,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:41,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-18 10:30:41,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:41,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:42,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 490 proven. 71 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-11-18 10:30:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:42,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-18 10:30:42,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:30:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:30:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:30:42,327 INFO L87 Difference]: Start difference. First operand 6098 states and 6796 transitions. Second operand 13 states. [2018-11-18 10:30:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:43,844 INFO L93 Difference]: Finished difference Result 10182 states and 11382 transitions. [2018-11-18 10:30:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 10:30:43,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 485 [2018-11-18 10:30:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:43,852 INFO L225 Difference]: With dead ends: 10182 [2018-11-18 10:30:43,852 INFO L226 Difference]: Without dead ends: 4710 [2018-11-18 10:30:43,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 479 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 10:30:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2018-11-18 10:30:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 2375. [2018-11-18 10:30:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-11-18 10:30:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2612 transitions. [2018-11-18 10:30:44,302 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2612 transitions. Word has length 485 [2018-11-18 10:30:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:44,303 INFO L480 AbstractCegarLoop]: Abstraction has 2375 states and 2612 transitions. [2018-11-18 10:30:44,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:30:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2612 transitions. [2018-11-18 10:30:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-18 10:30:44,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:44,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:44,307 INFO L423 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:44,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1632332447, now seen corresponding path program 1 times [2018-11-18 10:30:44,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:44,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:44,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:44,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2018-11-18 10:30:44,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:30:44,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:30:44,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:30:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:30:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:30:44,477 INFO L87 Difference]: Start difference. First operand 2375 states and 2612 transitions. Second operand 11 states. [2018-11-18 10:30:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:46,387 INFO L93 Difference]: Finished difference Result 7370 states and 8366 transitions. [2018-11-18 10:30:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 10:30:46,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 483 [2018-11-18 10:30:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:46,394 INFO L225 Difference]: With dead ends: 7370 [2018-11-18 10:30:46,395 INFO L226 Difference]: Without dead ends: 5631 [2018-11-18 10:30:46,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2018-11-18 10:30:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2018-11-18 10:30:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 2747. [2018-11-18 10:30:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-11-18 10:30:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 3026 transitions. [2018-11-18 10:30:46,917 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 3026 transitions. Word has length 483 [2018-11-18 10:30:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:46,917 INFO L480 AbstractCegarLoop]: Abstraction has 2747 states and 3026 transitions. [2018-11-18 10:30:46,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:30:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3026 transitions. [2018-11-18 10:30:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-18 10:30:46,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:46,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:46,920 INFO L423 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:46,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1804999007, now seen corresponding path program 1 times [2018-11-18 10:30:46,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:46,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:46,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2018-11-18 10:30:47,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:30:47,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:30:47,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:30:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:30:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:30:47,018 INFO L87 Difference]: Start difference. First operand 2747 states and 3026 transitions. Second operand 4 states. [2018-11-18 10:30:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:47,991 INFO L93 Difference]: Finished difference Result 6214 states and 6948 transitions. [2018-11-18 10:30:47,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:30:47,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2018-11-18 10:30:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:47,997 INFO L225 Difference]: With dead ends: 6214 [2018-11-18 10:30:47,997 INFO L226 Difference]: Without dead ends: 4103 [2018-11-18 10:30:47,999 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 10:30:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2018-11-18 10:30:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2699. [2018-11-18 10:30:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-11-18 10:30:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 2951 transitions. [2018-11-18 10:30:48,502 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 2951 transitions. Word has length 483 [2018-11-18 10:30:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:48,502 INFO L480 AbstractCegarLoop]: Abstraction has 2699 states and 2951 transitions. [2018-11-18 10:30:48,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:30:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 2951 transitions. [2018-11-18 10:30:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-18 10:30:48,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:48,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:48,505 INFO L423 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:48,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1767689676, now seen corresponding path program 1 times [2018-11-18 10:30:48,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:48,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2018-11-18 10:30:48,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:48,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:48,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:48,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-11-18 10:30:48,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:30:48,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2018-11-18 10:30:48,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:30:48,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:30:48,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:30:48,921 INFO L87 Difference]: Start difference. First operand 2699 states and 2951 transitions. Second operand 14 states. [2018-11-18 10:30:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:50,586 INFO L93 Difference]: Finished difference Result 6805 states and 7656 transitions. [2018-11-18 10:30:50,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 10:30:50,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 484 [2018-11-18 10:30:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:50,593 INFO L225 Difference]: With dead ends: 6805 [2018-11-18 10:30:50,593 INFO L226 Difference]: Without dead ends: 4742 [2018-11-18 10:30:50,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 479 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2018-11-18 10:30:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2018-11-18 10:30:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 2690. [2018-11-18 10:30:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2018-11-18 10:30:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 2930 transitions. [2018-11-18 10:30:51,102 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 2930 transitions. Word has length 484 [2018-11-18 10:30:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:51,103 INFO L480 AbstractCegarLoop]: Abstraction has 2690 states and 2930 transitions. [2018-11-18 10:30:51,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:30:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 2930 transitions. [2018-11-18 10:30:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-18 10:30:51,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:51,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:51,107 INFO L423 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:51,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:51,108 INFO L82 PathProgramCache]: Analyzing trace with hash -123053085, now seen corresponding path program 1 times [2018-11-18 10:30:51,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:51,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:51,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-11-18 10:30:51,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:51,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:51,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 545 proven. 98 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2018-11-18 10:30:51,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:51,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-18 10:30:51,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 10:30:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 10:30:51,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:30:51,658 INFO L87 Difference]: Start difference. First operand 2690 states and 2930 transitions. Second operand 18 states. [2018-11-18 10:30:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:54,968 INFO L93 Difference]: Finished difference Result 7163 states and 7867 transitions. [2018-11-18 10:30:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 10:30:54,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 484 [2018-11-18 10:30:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:54,976 INFO L225 Difference]: With dead ends: 7163 [2018-11-18 10:30:54,976 INFO L226 Difference]: Without dead ends: 5085 [2018-11-18 10:30:54,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 518 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2018-11-18 10:30:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2018-11-18 10:30:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4365. [2018-11-18 10:30:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2018-11-18 10:30:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 4748 transitions. [2018-11-18 10:30:55,875 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 4748 transitions. Word has length 484 [2018-11-18 10:30:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:55,875 INFO L480 AbstractCegarLoop]: Abstraction has 4365 states and 4748 transitions. [2018-11-18 10:30:55,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 10:30:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 4748 transitions. [2018-11-18 10:30:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-11-18 10:30:55,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:55,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:55,880 INFO L423 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:55,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2110120939, now seen corresponding path program 1 times [2018-11-18 10:30:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-11-18 10:30:56,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:56,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:30:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:56,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:30:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 537 proven. 92 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2018-11-18 10:30:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:30:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-11-18 10:30:56,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 10:30:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 10:30:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-11-18 10:30:56,455 INFO L87 Difference]: Start difference. First operand 4365 states and 4748 transitions. Second operand 27 states. [2018-11-18 10:31:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:20,053 INFO L93 Difference]: Finished difference Result 30007 states and 33581 transitions. [2018-11-18 10:31:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2018-11-18 10:31:20,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 486 [2018-11-18 10:31:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:31:20,087 INFO L225 Difference]: With dead ends: 30007 [2018-11-18 10:31:20,087 INFO L226 Difference]: Without dead ends: 26298 [2018-11-18 10:31:20,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60138 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11148, Invalid=132114, Unknown=0, NotChecked=0, Total=143262 [2018-11-18 10:31:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26298 states. [2018-11-18 10:31:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26298 to 9222. [2018-11-18 10:31:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2018-11-18 10:31:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 10022 transitions. [2018-11-18 10:31:22,497 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 10022 transitions. Word has length 486 [2018-11-18 10:31:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:31:22,498 INFO L480 AbstractCegarLoop]: Abstraction has 9222 states and 10022 transitions. [2018-11-18 10:31:22,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 10:31:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 10022 transitions. [2018-11-18 10:31:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-11-18 10:31:22,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:31:22,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:31:22,505 INFO L423 AbstractCegarLoop]: === Iteration 61 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:31:22,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:22,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1278637677, now seen corresponding path program 1 times [2018-11-18 10:31:22,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:22,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-11-18 10:31:22,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:31:22,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:31:22,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:22,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:31:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 538 proven. 153 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2018-11-18 10:31:23,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:31:23,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 35 [2018-11-18 10:31:23,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 10:31:23,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 10:31:23,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 10:31:23,294 INFO L87 Difference]: Start difference. First operand 9222 states and 10022 transitions. Second operand 35 states. [2018-11-18 10:31:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:41,030 INFO L93 Difference]: Finished difference Result 33586 states and 37844 transitions. [2018-11-18 10:31:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-11-18 10:31:41,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 488 [2018-11-18 10:31:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:31:41,064 INFO L225 Difference]: With dead ends: 33586 [2018-11-18 10:31:41,064 INFO L226 Difference]: Without dead ends: 25477 [2018-11-18 10:31:41,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 541 SyntacticMatches, 3 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18050 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3468, Invalid=43838, Unknown=0, NotChecked=0, Total=47306 [2018-11-18 10:31:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25477 states. [2018-11-18 10:31:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25477 to 12878. [2018-11-18 10:31:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-11-18 10:31:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 14054 transitions. [2018-11-18 10:31:44,420 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 14054 transitions. Word has length 488 [2018-11-18 10:31:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:31:44,421 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 14054 transitions. [2018-11-18 10:31:44,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 10:31:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 14054 transitions. [2018-11-18 10:31:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-11-18 10:31:44,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:31:44,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:31:44,431 INFO L423 AbstractCegarLoop]: === Iteration 62 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:31:44,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1025123977, now seen corresponding path program 1 times [2018-11-18 10:31:44,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1377 trivial. 0 not checked. [2018-11-18 10:31:44,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:31:44,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:31:44,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:44,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:31:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 391 proven. 305 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-11-18 10:31:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:31:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26] total 38 [2018-11-18 10:31:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 10:31:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 10:31:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1309, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 10:31:45,233 INFO L87 Difference]: Start difference. First operand 12878 states and 14054 transitions. Second operand 38 states. [2018-11-18 10:32:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:32:57,704 INFO L93 Difference]: Finished difference Result 70301 states and 80587 transitions. [2018-11-18 10:32:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 703 states. [2018-11-18 10:32:57,705 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 489 [2018-11-18 10:32:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:32:57,796 INFO L225 Difference]: With dead ends: 70301 [2018-11-18 10:32:57,796 INFO L226 Difference]: Without dead ends: 58860 [2018-11-18 10:32:57,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1471 GetRequests, 722 SyntacticMatches, 22 SemanticMatches, 727 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239563 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=22598, Invalid=508114, Unknown=0, NotChecked=0, Total=530712 [2018-11-18 10:32:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58860 states. [2018-11-18 10:33:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58860 to 23031. [2018-11-18 10:33:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23031 states. [2018-11-18 10:33:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23031 states to 23031 states and 25053 transitions. [2018-11-18 10:33:03,843 INFO L78 Accepts]: Start accepts. Automaton has 23031 states and 25053 transitions. Word has length 489 [2018-11-18 10:33:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:33:03,844 INFO L480 AbstractCegarLoop]: Abstraction has 23031 states and 25053 transitions. [2018-11-18 10:33:03,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 10:33:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 23031 states and 25053 transitions. [2018-11-18 10:33:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-11-18 10:33:03,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:33:03,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:33:03,862 INFO L423 AbstractCegarLoop]: === Iteration 63 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:33:03,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:33:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1507537345, now seen corresponding path program 1 times [2018-11-18 10:33:03,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:33:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:33:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:03,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:33:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:33:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2018-11-18 10:33:03,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:33:03,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:33:03,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:33:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:33:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:33:03,967 INFO L87 Difference]: Start difference. First operand 23031 states and 25053 transitions. Second operand 4 states. [2018-11-18 10:33:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:33:09,284 INFO L93 Difference]: Finished difference Result 44681 states and 48790 transitions. [2018-11-18 10:33:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:33:09,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 490 [2018-11-18 10:33:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:33:09,317 INFO L225 Difference]: With dead ends: 44681 [2018-11-18 10:33:09,318 INFO L226 Difference]: Without dead ends: 23415 [2018-11-18 10:33:09,337 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 10:33:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23415 states. [2018-11-18 10:33:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23415 to 23139. [2018-11-18 10:33:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23139 states. [2018-11-18 10:33:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23139 states to 23139 states and 25185 transitions. [2018-11-18 10:33:15,073 INFO L78 Accepts]: Start accepts. Automaton has 23139 states and 25185 transitions. Word has length 490 [2018-11-18 10:33:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:33:15,073 INFO L480 AbstractCegarLoop]: Abstraction has 23139 states and 25185 transitions. [2018-11-18 10:33:15,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:33:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 23139 states and 25185 transitions. [2018-11-18 10:33:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-11-18 10:33:15,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:33:15,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:33:15,094 INFO L423 AbstractCegarLoop]: === Iteration 64 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:33:15,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:33:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1765702783, now seen corresponding path program 1 times [2018-11-18 10:33:15,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:33:15,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:33:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:33:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:33:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2018-11-18 10:33:15,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:33:15,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:33:15,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:33:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:33:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:33:15,359 INFO L87 Difference]: Start difference. First operand 23139 states and 25185 transitions. Second operand 11 states. [2018-11-18 10:33:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:33:29,119 INFO L93 Difference]: Finished difference Result 66068 states and 73825 transitions. [2018-11-18 10:33:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 10:33:29,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 490 [2018-11-18 10:33:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:33:29,187 INFO L225 Difference]: With dead ends: 66068 [2018-11-18 10:33:29,187 INFO L226 Difference]: Without dead ends: 44694 [2018-11-18 10:33:29,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:33:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44694 states. [2018-11-18 10:33:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44694 to 22923. [2018-11-18 10:33:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22923 states. [2018-11-18 10:33:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22923 states to 22923 states and 24897 transitions. [2018-11-18 10:33:35,355 INFO L78 Accepts]: Start accepts. Automaton has 22923 states and 24897 transitions. Word has length 490 [2018-11-18 10:33:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:33:35,355 INFO L480 AbstractCegarLoop]: Abstraction has 22923 states and 24897 transitions. [2018-11-18 10:33:35,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:33:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 22923 states and 24897 transitions. [2018-11-18 10:33:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-11-18 10:33:35,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:33:35,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:33:35,375 INFO L423 AbstractCegarLoop]: === Iteration 65 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:33:35,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:33:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash 566410454, now seen corresponding path program 1 times [2018-11-18 10:33:35,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:33:35,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:33:35,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:35,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:33:35,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:33:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:33:35,593 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 10:33:35,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:33:35 BoogieIcfgContainer [2018-11-18 10:33:35,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:33:35,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:33:35,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:33:35,805 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:33:35,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:27:43" (3/4) ... [2018-11-18 10:33:35,807 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 10:33:36,084 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68e5a625-afc8-42cc-ad5c-b991b6e8913b/bin-2019/uautomizer/witness.graphml [2018-11-18 10:33:36,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:33:36,085 INFO L168 Benchmark]: Toolchain (without parser) took 353542.55 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 959.1 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 998.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:33:36,086 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 10:33:36,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:33:36,086 INFO L168 Benchmark]: Boogie Preprocessor took 41.46 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:33:36,087 INFO L168 Benchmark]: RCFGBuilder took 514.01 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: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:33:36,087 INFO L168 Benchmark]: TraceAbstraction took 352429.36 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 893.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:33:36,087 INFO L168 Benchmark]: Witness Printer took 280.19 ms. Allocated memory is still 4.5 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:33:36,088 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 274.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.46 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.01 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: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 352429.36 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 893.4 MB. Max. memory is 11.5 GB. * Witness Printer took 280.19 ms. Allocated memory is still 4.5 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 576]: 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 ; [L515] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; VAL [\old(g1v)=548, \old(g1v_new)=544, \old(g1v_old)=537, \old(g2v)=523, \old(g2v_new)=517, \old(g2v_old)=543, \old(g3v)=528, \old(g3v_new)=535, \old(g3v_old)=531, \old(gate1Failed)=20, \old(gate1Failed_History_0)=30, \old(gate1Failed_History_1)=6, \old(gate1Failed_History_2)=4, \old(gate2Failed)=15, \old(gate2Failed_History_0)=18, \old(gate2Failed_History_1)=9, \old(gate2Failed_History_2)=35, \old(gate3Failed)=38, \old(gate3Failed_History_0)=33, \old(gate3Failed_History_1)=22, \old(gate3Failed_History_2)=12, \old(nomsg)=529, \old(VALUE1)=539, \old(VALUE2)=514, \old(VALUE3)=520, \old(votedValue_History_0)=519, \old(votedValue_History_1)=546, \old(votedValue_History_2)=525, 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] [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] gate1Failed = __VERIFIER_nondet_bool() [L524] gate2Failed = __VERIFIER_nondet_bool() [L525] gate3Failed = __VERIFIER_nondet_bool() [L526] VALUE1 = __VERIFIER_nondet_char() [L527] VALUE2 = __VERIFIER_nondet_char() [L528] VALUE3 = __VERIFIER_nondet_char() [L529] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L530] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L531] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L532] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L533] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L534] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L535] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L536] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L537] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L538] votedValue_History_0 = __VERIFIER_nondet_char() [L539] votedValue_History_1 = __VERIFIER_nondet_char() [L540] votedValue_History_2 = __VERIFIER_nondet_char() [L541] 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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] [L541] 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, init()=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L541] i2 = init() [L543] g1v_old = nomsg [L544] g1v_new = nomsg [L545] g2v_old = nomsg [L546] g2v_new = nomsg [L547] g3v_old = nomsg [L548] g3v_new = nomsg [L549] 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L550] COND TRUE 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, 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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L552] 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)=10, \old(gate3Failed_History_2)=14, \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=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=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)=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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=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)=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)=10, \old(gate3Failed_History_2)=14, \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=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, 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)=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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L396] COND FALSE !((int )next_state == 0) 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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L399] COND TRUE (int )next_state == 1 [L400] 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)=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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, 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] [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)=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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=1, 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] [L408] RET g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L552] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L553] 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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=-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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L421] COND FALSE !(\read(gate2Failed)) [L425] tmp = __VERIFIER_nondet_char() [L426] next_state = tmp 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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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] [L427] COND TRUE (int )next_state == 0 [L428] tmp___0 = 1 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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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] [L439] COND TRUE, EXPR next_state != nomsg && g2v_new == nomsg ? next_state : 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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \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)=10, \old(gate3Failed_History_2)=14, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=0, next_state != nomsg && g2v_new == nomsg ? next_state : g2v_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] [L439] RET g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L553] 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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L554] 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)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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 [L554] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L555] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L487] COND TRUE (int )VALUE1 == (int )nomsg [L488] voted_value = VALUE3 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L555] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L562] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [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=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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] [L562] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L562] c1 = check() [L563] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L574] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L563] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L550] COND TRUE 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, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L552] 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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 [L552] 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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L553] 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, 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=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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 [L553] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L554] 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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 [L554] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L555] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L493] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L500] COND TRUE (int )VALUE1 != (int )nomsg [L501] voted_value = VALUE1 VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] CALL write_history_int8(3, voted_value) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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)=1, \old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L511] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L555] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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)=0, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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)=0, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND FALSE !((int )VALUE2 == (int )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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND FALSE !((int )VALUE3 == (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=-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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L325] COND TRUE (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=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L326] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L327] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L339] COND TRUE ! (temp_count > 1) [L340] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] c1 = check() [L563] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L574] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L576] __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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 210 locations, 1 error locations. UNSAFE Result, 352.3s OverallTime, 65 OverallIterations, 16 TraceHistogramMax, 286.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31878 SDtfs, 54411 SDslu, 89737 SDs, 0 SdLazy, 424535 SolverSat, 28992 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 121.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18495 GetRequests, 14613 SyntacticMatches, 94 SemanticMatches, 3788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532842 ImplicationChecksByTransitivity, 67.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23139occurred in iteration=63, 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: 41.7s AutomataMinimizationTime, 64 MinimizatonAttempts, 187247 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 34855 NumberOfCodeBlocks, 34855 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 34269 ConstructedInterpolants, 0 QuantifiedInterpolants, 31849026 SizeOfPredicates, 111 NumberOfNonLiveVariables, 61929 ConjunctsInSsa, 1039 ConjunctsInUnsatCore, 97 InterpolantComputations, 42 PerfectInterpolantSequences, 87228/89989 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...