/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 02:05:29,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 02:05:29,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 02:05:29,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 02:05:29,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 02:05:29,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 02:05:29,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 02:05:29,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 02:05:29,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 02:05:29,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 02:05:29,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 02:05:29,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 02:05:29,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 02:05:29,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 02:05:29,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 02:05:29,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 02:05:29,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 02:05:29,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 02:05:29,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 02:05:29,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 02:05:29,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 02:05:29,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 02:05:29,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 02:05:29,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 02:05:29,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 02:05:29,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 02:05:29,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 02:05:29,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 02:05:29,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 02:05:29,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 02:05:29,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 02:05:29,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 02:05:29,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 02:05:29,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 02:05:29,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 02:05:29,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 02:05:29,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 02:05:29,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 02:05:29,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 02:05:29,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 02:05:29,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 02:05:29,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 02:05:29,744 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 02:05:29,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 02:05:29,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 02:05:29,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 02:05:29,750 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 02:05:29,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 02:05:29,751 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 02:05:29,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 02:05:29,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 02:05:29,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 02:05:29,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 02:05:29,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 02:05:29,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 02:05:29,752 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 02:05:29,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 02:05:29,753 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 02:05:29,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 02:05:29,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 02:05:29,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 02:05:29,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 02:05:29,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 02:05:29,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 02:05:29,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 02:05:29,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 02:05:29,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 02:05:29,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 02:05:29,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 02:05:29,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 02:05:29,757 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 02:05:29,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 02:05:30,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 02:05:30,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 02:05:30,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 02:05:30,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 02:05:30,072 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 02:05:30,073 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-07-20 02:05:30,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b65c93f/647abaa0d0704dc1952df3ae466d04ac/FLAGe55eb429a [2020-07-20 02:05:30,710 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 02:05:30,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-07-20 02:05:30,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b65c93f/647abaa0d0704dc1952df3ae466d04ac/FLAGe55eb429a [2020-07-20 02:05:30,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b65c93f/647abaa0d0704dc1952df3ae466d04ac [2020-07-20 02:05:30,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 02:05:30,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 02:05:30,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 02:05:30,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 02:05:30,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 02:05:30,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:05:30" (1/1) ... [2020-07-20 02:05:30,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3581c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:30, skipping insertion in model container [2020-07-20 02:05:30,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:05:30" (1/1) ... [2020-07-20 02:05:30,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 02:05:31,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 02:05:31,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:05:31,416 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 02:05:31,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:05:31,530 INFO L208 MainTranslator]: Completed translation [2020-07-20 02:05:31,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31 WrapperNode [2020-07-20 02:05:31,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 02:05:31,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 02:05:31,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 02:05:31,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 02:05:31,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... [2020-07-20 02:05:31,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 02:05:31,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 02:05:31,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 02:05:31,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 02:05:31,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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 [2020-07-20 02:05:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 02:05:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 02:05:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 02:05:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-07-20 02:05:31,682 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-07-20 02:05:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-20 02:05:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-07-20 02:05:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-07-20 02:05:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-07-20 02:05:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-07-20 02:05:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-07-20 02:05:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-20 02:05:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 02:05:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-07-20 02:05:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 02:05:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-20 02:05:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-20 02:05:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-07-20 02:05:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-07-20 02:05:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-07-20 02:05:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 02:05:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 02:05:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-07-20 02:05:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-07-20 02:05:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-07-20 02:05:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-07-20 02:05:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-07-20 02:05:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-07-20 02:05:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-07-20 02:05:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-07-20 02:05:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-20 02:05:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-07-20 02:05:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-07-20 02:05:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-07-20 02:05:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-07-20 02:05:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-07-20 02:05:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-20 02:05:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 02:05:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 02:05:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 02:05:32,568 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 02:05:32,569 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-20 02:05:32,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:05:32 BoogieIcfgContainer [2020-07-20 02:05:32,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 02:05:32,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 02:05:32,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 02:05:32,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 02:05:32,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:05:30" (1/3) ... [2020-07-20 02:05:32,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ce0d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:05:32, skipping insertion in model container [2020-07-20 02:05:32,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:05:31" (2/3) ... [2020-07-20 02:05:32,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ce0d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:05:32, skipping insertion in model container [2020-07-20 02:05:32,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:05:32" (3/3) ... [2020-07-20 02:05:32,593 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-07-20 02:05:32,603 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 02:05:32,612 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 02:05:32,625 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 02:05:32,649 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 02:05:32,649 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 02:05:32,650 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 02:05:32,650 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 02:05:32,650 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 02:05:32,650 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 02:05:32,650 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 02:05:32,651 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 02:05:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2020-07-20 02:05:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-20 02:05:32,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:32,694 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:32,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1549655252, now seen corresponding path program 1 times [2020-07-20 02:05:32,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:32,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291890537] [2020-07-20 02:05:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,300 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:05:33,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291890537] [2020-07-20 02:05:33,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:33,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 02:05:33,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806072340] [2020-07-20 02:05:33,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 02:05:33,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 02:05:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:05:33,614 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 9 states. [2020-07-20 02:05:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:35,309 INFO L93 Difference]: Finished difference Result 456 states and 705 transitions. [2020-07-20 02:05:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 02:05:35,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-07-20 02:05:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:35,327 INFO L225 Difference]: With dead ends: 456 [2020-07-20 02:05:35,328 INFO L226 Difference]: Without dead ends: 237 [2020-07-20 02:05:35,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2020-07-20 02:05:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-07-20 02:05:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-07-20 02:05:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-07-20 02:05:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 342 transitions. [2020-07-20 02:05:35,439 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 342 transitions. Word has length 71 [2020-07-20 02:05:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:35,440 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 342 transitions. [2020-07-20 02:05:35,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 02:05:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 342 transitions. [2020-07-20 02:05:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-20 02:05:35,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:35,449 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:35,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 02:05:35,449 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 695502060, now seen corresponding path program 1 times [2020-07-20 02:05:35,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:35,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837705045] [2020-07-20 02:05:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,739 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:05:36,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837705045] [2020-07-20 02:05:36,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:36,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-20 02:05:36,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080201435] [2020-07-20 02:05:36,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 02:05:36,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 02:05:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:05:36,045 INFO L87 Difference]: Start difference. First operand 237 states and 342 transitions. Second operand 14 states. [2020-07-20 02:05:36,232 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:05:36,489 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:05:36,672 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:05:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:39,075 INFO L93 Difference]: Finished difference Result 455 states and 653 transitions. [2020-07-20 02:05:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 02:05:39,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-07-20 02:05:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:39,080 INFO L225 Difference]: With dead ends: 455 [2020-07-20 02:05:39,080 INFO L226 Difference]: Without dead ends: 237 [2020-07-20 02:05:39,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-07-20 02:05:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-07-20 02:05:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-07-20 02:05:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-07-20 02:05:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2020-07-20 02:05:39,122 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 71 [2020-07-20 02:05:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:39,122 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2020-07-20 02:05:39,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 02:05:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2020-07-20 02:05:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-20 02:05:39,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:39,125 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:39,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 02:05:39,125 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1333871800, now seen corresponding path program 1 times [2020-07-20 02:05:39,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:39,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319398396] [2020-07-20 02:05:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,356 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:05:39,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319398396] [2020-07-20 02:05:39,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:39,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 02:05:39,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810750046] [2020-07-20 02:05:39,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 02:05:39,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 02:05:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:05:39,533 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 11 states. [2020-07-20 02:05:40,448 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:05:40,579 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:05:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:41,755 INFO L93 Difference]: Finished difference Result 454 states and 645 transitions. [2020-07-20 02:05:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 02:05:41,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-07-20 02:05:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:41,760 INFO L225 Difference]: With dead ends: 454 [2020-07-20 02:05:41,760 INFO L226 Difference]: Without dead ends: 241 [2020-07-20 02:05:41,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:05:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-20 02:05:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-07-20 02:05:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-07-20 02:05:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2020-07-20 02:05:41,797 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 82 [2020-07-20 02:05:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:41,797 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2020-07-20 02:05:41,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 02:05:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2020-07-20 02:05:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-20 02:05:41,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:41,801 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:41,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 02:05:41,801 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1250466386, now seen corresponding path program 1 times [2020-07-20 02:05:41,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:41,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174050789] [2020-07-20 02:05:41,803 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:05:42,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174050789] [2020-07-20 02:05:42,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:42,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-20 02:05:42,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823452590] [2020-07-20 02:05:42,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 02:05:42,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 02:05:42,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-20 02:05:42,370 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand 16 states. [2020-07-20 02:05:42,549 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:05:44,518 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:05:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:46,386 INFO L93 Difference]: Finished difference Result 549 states and 758 transitions. [2020-07-20 02:05:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 02:05:46,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-07-20 02:05:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:46,393 INFO L225 Difference]: With dead ends: 549 [2020-07-20 02:05:46,393 INFO L226 Difference]: Without dead ends: 332 [2020-07-20 02:05:46,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-07-20 02:05:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-07-20 02:05:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2020-07-20 02:05:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-07-20 02:05:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-07-20 02:05:46,439 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 104 [2020-07-20 02:05:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:46,439 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-07-20 02:05:46,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 02:05:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-07-20 02:05:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-20 02:05:46,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:46,443 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:46,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 02:05:46,443 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1479117531, now seen corresponding path program 1 times [2020-07-20 02:05:46,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:46,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680366458] [2020-07-20 02:05:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,673 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:05:47,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680366458] [2020-07-20 02:05:47,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:47,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-20 02:05:47,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715141236] [2020-07-20 02:05:47,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 02:05:47,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 02:05:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-20 02:05:47,022 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 16 states. [2020-07-20 02:05:47,187 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:05:49,023 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:05:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:50,863 INFO L93 Difference]: Finished difference Result 555 states and 766 transitions. [2020-07-20 02:05:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 02:05:50,863 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-07-20 02:05:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:50,867 INFO L225 Difference]: With dead ends: 555 [2020-07-20 02:05:50,867 INFO L226 Difference]: Without dead ends: 335 [2020-07-20 02:05:50,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-07-20 02:05:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-07-20 02:05:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2020-07-20 02:05:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-07-20 02:05:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-07-20 02:05:50,922 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 105 [2020-07-20 02:05:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:50,923 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-07-20 02:05:50,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 02:05:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-07-20 02:05:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-20 02:05:50,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:50,926 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:50,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 02:05:50,926 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:50,927 INFO L82 PathProgramCache]: Analyzing trace with hash -717194829, now seen corresponding path program 1 times [2020-07-20 02:05:50,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:50,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461887715] [2020-07-20 02:05:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,143 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:05:51,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461887715] [2020-07-20 02:05:51,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:51,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 02:05:51,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622987735] [2020-07-20 02:05:51,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 02:05:51,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 02:05:51,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:05:51,369 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 12 states. [2020-07-20 02:05:52,090 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:05:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:54,806 INFO L93 Difference]: Finished difference Result 788 states and 1093 transitions. [2020-07-20 02:05:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 02:05:54,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-07-20 02:05:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:54,813 INFO L225 Difference]: With dead ends: 788 [2020-07-20 02:05:54,813 INFO L226 Difference]: Without dead ends: 568 [2020-07-20 02:05:54,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-20 02:05:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-07-20 02:05:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 551. [2020-07-20 02:05:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-07-20 02:05:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 759 transitions. [2020-07-20 02:05:54,882 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 759 transitions. Word has length 107 [2020-07-20 02:05:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:54,883 INFO L479 AbstractCegarLoop]: Abstraction has 551 states and 759 transitions. [2020-07-20 02:05:54,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 02:05:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 759 transitions. [2020-07-20 02:05:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-20 02:05:54,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:54,885 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:54,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 02:05:54,886 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash 654438841, now seen corresponding path program 1 times [2020-07-20 02:05:54,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:54,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322650035] [2020-07-20 02:05:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,055 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:05:55,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322650035] [2020-07-20 02:05:55,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:55,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 02:05:55,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657345928] [2020-07-20 02:05:55,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 02:05:55,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:55,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 02:05:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:05:55,279 INFO L87 Difference]: Start difference. First operand 551 states and 759 transitions. Second operand 12 states. [2020-07-20 02:05:56,418 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:05:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:59,029 INFO L93 Difference]: Finished difference Result 1308 states and 1846 transitions. [2020-07-20 02:05:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 02:05:59,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-07-20 02:05:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:59,040 INFO L225 Difference]: With dead ends: 1308 [2020-07-20 02:05:59,040 INFO L226 Difference]: Without dead ends: 911 [2020-07-20 02:05:59,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-20 02:05:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2020-07-20 02:05:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 905. [2020-07-20 02:05:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2020-07-20 02:05:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1266 transitions. [2020-07-20 02:05:59,172 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1266 transitions. Word has length 108 [2020-07-20 02:05:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:59,172 INFO L479 AbstractCegarLoop]: Abstraction has 905 states and 1266 transitions. [2020-07-20 02:05:59,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 02:05:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1266 transitions. [2020-07-20 02:05:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-20 02:05:59,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:59,176 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:59,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 02:05:59,176 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash 925446042, now seen corresponding path program 1 times [2020-07-20 02:05:59,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:59,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712190377] [2020-07-20 02:05:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:05:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,359 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:05:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:05:59,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712190377] [2020-07-20 02:05:59,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:59,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 02:05:59,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071627527] [2020-07-20 02:05:59,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 02:05:59,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 02:05:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:05:59,637 INFO L87 Difference]: Start difference. First operand 905 states and 1266 transitions. Second operand 12 states. [2020-07-20 02:05:59,783 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:03,130 INFO L93 Difference]: Finished difference Result 1649 states and 2335 transitions. [2020-07-20 02:06:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 02:06:03,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-07-20 02:06:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:03,139 INFO L225 Difference]: With dead ends: 1649 [2020-07-20 02:06:03,139 INFO L226 Difference]: Without dead ends: 916 [2020-07-20 02:06:03,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-20 02:06:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-07-20 02:06:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 910. [2020-07-20 02:06:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-07-20 02:06:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1268 transitions. [2020-07-20 02:06:03,243 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1268 transitions. Word has length 109 [2020-07-20 02:06:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:03,244 INFO L479 AbstractCegarLoop]: Abstraction has 910 states and 1268 transitions. [2020-07-20 02:06:03,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 02:06:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1268 transitions. [2020-07-20 02:06:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-20 02:06:03,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:03,247 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:03,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 02:06:03,247 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -625424837, now seen corresponding path program 1 times [2020-07-20 02:06:03,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:03,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456309900] [2020-07-20 02:06:03,248 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,476 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:06:03,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456309900] [2020-07-20 02:06:03,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:03,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 02:06:03,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635420636] [2020-07-20 02:06:03,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 02:06:03,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 02:06:03,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:06:03,721 INFO L87 Difference]: Start difference. First operand 910 states and 1268 transitions. Second operand 13 states. [2020-07-20 02:06:05,109 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:05,243 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:06,225 INFO L93 Difference]: Finished difference Result 1663 states and 2354 transitions. [2020-07-20 02:06:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:06:06,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-07-20 02:06:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:06,231 INFO L225 Difference]: With dead ends: 1663 [2020-07-20 02:06:06,231 INFO L226 Difference]: Without dead ends: 930 [2020-07-20 02:06:06,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:06:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-07-20 02:06:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2020-07-20 02:06:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-07-20 02:06:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1284 transitions. [2020-07-20 02:06:06,334 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1284 transitions. Word has length 108 [2020-07-20 02:06:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:06,334 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1284 transitions. [2020-07-20 02:06:06,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 02:06:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1284 transitions. [2020-07-20 02:06:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-20 02:06:06,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:06,337 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:06,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 02:06:06,337 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 442586826, now seen corresponding path program 1 times [2020-07-20 02:06:06,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:06,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374310032] [2020-07-20 02:06:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,522 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:06:06,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374310032] [2020-07-20 02:06:06,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:06,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 02:06:06,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915775711] [2020-07-20 02:06:06,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 02:06:06,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 02:06:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:06:06,762 INFO L87 Difference]: Start difference. First operand 930 states and 1284 transitions. Second operand 12 states. [2020-07-20 02:06:06,907 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:10,475 INFO L93 Difference]: Finished difference Result 1715 states and 2391 transitions. [2020-07-20 02:06:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 02:06:10,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2020-07-20 02:06:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:10,481 INFO L225 Difference]: With dead ends: 1715 [2020-07-20 02:06:10,482 INFO L226 Difference]: Without dead ends: 962 [2020-07-20 02:06:10,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-20 02:06:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-07-20 02:06:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 930. [2020-07-20 02:06:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-07-20 02:06:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1280 transitions. [2020-07-20 02:06:10,587 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1280 transitions. Word has length 117 [2020-07-20 02:06:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:10,587 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1280 transitions. [2020-07-20 02:06:10,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 02:06:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1280 transitions. [2020-07-20 02:06:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-07-20 02:06:10,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:10,590 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:10,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 02:06:10,590 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash -208311273, now seen corresponding path program 1 times [2020-07-20 02:06:10,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:10,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305079440] [2020-07-20 02:06:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,869 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:06:11,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305079440] [2020-07-20 02:06:11,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:11,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 02:06:11,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912394731] [2020-07-20 02:06:11,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 02:06:11,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 02:06:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:06:11,105 INFO L87 Difference]: Start difference. First operand 930 states and 1280 transitions. Second operand 13 states. [2020-07-20 02:06:12,655 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:12,795 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:13,732 INFO L93 Difference]: Finished difference Result 1703 states and 2388 transitions. [2020-07-20 02:06:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:06:13,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-07-20 02:06:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:13,740 INFO L225 Difference]: With dead ends: 1703 [2020-07-20 02:06:13,740 INFO L226 Difference]: Without dead ends: 950 [2020-07-20 02:06:13,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:06:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-07-20 02:06:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-07-20 02:06:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-07-20 02:06:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1296 transitions. [2020-07-20 02:06:13,840 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1296 transitions. Word has length 116 [2020-07-20 02:06:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:13,841 INFO L479 AbstractCegarLoop]: Abstraction has 950 states and 1296 transitions. [2020-07-20 02:06:13,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 02:06:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1296 transitions. [2020-07-20 02:06:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-20 02:06:13,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:13,843 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:13,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 02:06:13,844 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2072056031, now seen corresponding path program 1 times [2020-07-20 02:06:13,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:13,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447774497] [2020-07-20 02:06:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,028 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:06:14,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447774497] [2020-07-20 02:06:14,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:14,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 02:06:14,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109079488] [2020-07-20 02:06:14,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 02:06:14,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 02:06:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:06:14,388 INFO L87 Difference]: Start difference. First operand 950 states and 1296 transitions. Second operand 13 states. [2020-07-20 02:06:16,035 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:16,171 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:16,926 INFO L93 Difference]: Finished difference Result 1739 states and 2404 transitions. [2020-07-20 02:06:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:06:16,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-07-20 02:06:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:16,937 INFO L225 Difference]: With dead ends: 1739 [2020-07-20 02:06:16,938 INFO L226 Difference]: Without dead ends: 966 [2020-07-20 02:06:16,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:06:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2020-07-20 02:06:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2020-07-20 02:06:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2020-07-20 02:06:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1308 transitions. [2020-07-20 02:06:17,077 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1308 transitions. Word has length 124 [2020-07-20 02:06:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:17,078 INFO L479 AbstractCegarLoop]: Abstraction has 966 states and 1308 transitions. [2020-07-20 02:06:17,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 02:06:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1308 transitions. [2020-07-20 02:06:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-20 02:06:17,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:17,080 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:17,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 02:06:17,081 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash 689076351, now seen corresponding path program 1 times [2020-07-20 02:06:17,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:17,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314772661] [2020-07-20 02:06:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 02:06:17,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314772661] [2020-07-20 02:06:17,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:17,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 02:06:17,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984249077] [2020-07-20 02:06:17,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 02:06:17,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 02:06:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:06:17,517 INFO L87 Difference]: Start difference. First operand 966 states and 1308 transitions. Second operand 13 states. [2020-07-20 02:06:19,035 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:19,172 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:20,010 INFO L93 Difference]: Finished difference Result 1775 states and 2444 transitions. [2020-07-20 02:06:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:06:20,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-07-20 02:06:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:20,017 INFO L225 Difference]: With dead ends: 1775 [2020-07-20 02:06:20,017 INFO L226 Difference]: Without dead ends: 986 [2020-07-20 02:06:20,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:06:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-07-20 02:06:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2020-07-20 02:06:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-07-20 02:06:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1324 transitions. [2020-07-20 02:06:20,112 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1324 transitions. Word has length 124 [2020-07-20 02:06:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:20,113 INFO L479 AbstractCegarLoop]: Abstraction has 986 states and 1324 transitions. [2020-07-20 02:06:20,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 02:06:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1324 transitions. [2020-07-20 02:06:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-07-20 02:06:20,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:20,116 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:20,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 02:06:20,116 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1921569727, now seen corresponding path program 1 times [2020-07-20 02:06:20,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:20,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503995158] [2020-07-20 02:06:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-20 02:06:20,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503995158] [2020-07-20 02:06:20,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:20,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 02:06:20,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68381119] [2020-07-20 02:06:20,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 02:06:20,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:20,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 02:06:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:06:20,579 INFO L87 Difference]: Start difference. First operand 986 states and 1324 transitions. Second operand 13 states. [2020-07-20 02:06:22,368 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:22,582 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:23,382 INFO L93 Difference]: Finished difference Result 1819 states and 2472 transitions. [2020-07-20 02:06:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:06:23,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2020-07-20 02:06:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:23,395 INFO L225 Difference]: With dead ends: 1819 [2020-07-20 02:06:23,395 INFO L226 Difference]: Without dead ends: 1010 [2020-07-20 02:06:23,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:06:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2020-07-20 02:06:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2020-07-20 02:06:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2020-07-20 02:06:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1344 transitions. [2020-07-20 02:06:23,557 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1344 transitions. Word has length 132 [2020-07-20 02:06:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:23,558 INFO L479 AbstractCegarLoop]: Abstraction has 1010 states and 1344 transitions. [2020-07-20 02:06:23,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 02:06:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1344 transitions. [2020-07-20 02:06:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-20 02:06:23,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:23,563 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:23,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 02:06:23,563 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -104310266, now seen corresponding path program 1 times [2020-07-20 02:06:23,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:23,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88733583] [2020-07-20 02:06:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,022 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-20 02:06:24,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88733583] [2020-07-20 02:06:24,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:24,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-20 02:06:24,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12451297] [2020-07-20 02:06:24,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 02:06:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:24,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 02:06:24,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:06:24,613 INFO L87 Difference]: Start difference. First operand 1010 states and 1344 transitions. Second operand 19 states. [2020-07-20 02:06:24,911 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 02:06:25,147 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:25,556 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-20 02:06:26,422 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:27,456 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-07-20 02:06:27,656 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-20 02:06:28,279 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:28,550 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:28,798 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:30,698 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:30,849 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:30,999 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:31,161 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-20 02:06:31,315 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:31,625 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-20 02:06:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:34,072 INFO L93 Difference]: Finished difference Result 2689 states and 3552 transitions. [2020-07-20 02:06:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-20 02:06:34,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 137 [2020-07-20 02:06:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:34,084 INFO L225 Difference]: With dead ends: 2689 [2020-07-20 02:06:34,084 INFO L226 Difference]: Without dead ends: 1844 [2020-07-20 02:06:34,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2020-07-20 02:06:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2020-07-20 02:06:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1744. [2020-07-20 02:06:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2020-07-20 02:06:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2274 transitions. [2020-07-20 02:06:34,289 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2274 transitions. Word has length 137 [2020-07-20 02:06:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:34,289 INFO L479 AbstractCegarLoop]: Abstraction has 1744 states and 2274 transitions. [2020-07-20 02:06:34,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 02:06:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2274 transitions. [2020-07-20 02:06:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-07-20 02:06:34,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:34,292 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:34,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 02:06:34,292 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -417494266, now seen corresponding path program 1 times [2020-07-20 02:06:34,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:34,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399884733] [2020-07-20 02:06:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-20 02:06:34,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399884733] [2020-07-20 02:06:34,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:34,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 02:06:34,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112112618] [2020-07-20 02:06:34,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 02:06:34,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 02:06:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:06:34,730 INFO L87 Difference]: Start difference. First operand 1744 states and 2274 transitions. Second operand 13 states. [2020-07-20 02:06:36,313 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:36,441 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:37,226 INFO L93 Difference]: Finished difference Result 3165 states and 4154 transitions. [2020-07-20 02:06:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:06:37,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-07-20 02:06:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:37,238 INFO L225 Difference]: With dead ends: 3165 [2020-07-20 02:06:37,238 INFO L226 Difference]: Without dead ends: 1760 [2020-07-20 02:06:37,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:06:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2020-07-20 02:06:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1748. [2020-07-20 02:06:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2020-07-20 02:06:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2252 transitions. [2020-07-20 02:06:37,486 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2252 transitions. Word has length 139 [2020-07-20 02:06:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:37,487 INFO L479 AbstractCegarLoop]: Abstraction has 1748 states and 2252 transitions. [2020-07-20 02:06:37,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 02:06:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2252 transitions. [2020-07-20 02:06:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-20 02:06:37,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:37,491 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:37,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 02:06:37,492 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -836486505, now seen corresponding path program 1 times [2020-07-20 02:06:37,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:37,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258619884] [2020-07-20 02:06:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,784 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 02:06:38,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258619884] [2020-07-20 02:06:38,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:38,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-20 02:06:38,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000210316] [2020-07-20 02:06:38,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 02:06:38,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 02:06:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:06:38,144 INFO L87 Difference]: Start difference. First operand 1748 states and 2252 transitions. Second operand 19 states. [2020-07-20 02:06:38,403 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:40,910 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:06:41,125 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:41,323 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-07-20 02:06:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:42,014 INFO L93 Difference]: Finished difference Result 1852 states and 2401 transitions. [2020-07-20 02:06:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 02:06:42,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 140 [2020-07-20 02:06:42,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:42,023 INFO L225 Difference]: With dead ends: 1852 [2020-07-20 02:06:42,023 INFO L226 Difference]: Without dead ends: 1850 [2020-07-20 02:06:42,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2020-07-20 02:06:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2020-07-20 02:06:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1776. [2020-07-20 02:06:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2020-07-20 02:06:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2284 transitions. [2020-07-20 02:06:42,232 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2284 transitions. Word has length 140 [2020-07-20 02:06:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:42,232 INFO L479 AbstractCegarLoop]: Abstraction has 1776 states and 2284 transitions. [2020-07-20 02:06:42,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 02:06:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2284 transitions. [2020-07-20 02:06:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-07-20 02:06:42,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:42,235 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:42,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 02:06:42,235 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1769179939, now seen corresponding path program 1 times [2020-07-20 02:06:42,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:42,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646254193] [2020-07-20 02:06:42,236 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,472 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 02:06:42,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646254193] [2020-07-20 02:06:42,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:42,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-20 02:06:42,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239358217] [2020-07-20 02:06:42,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 02:06:42,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 02:06:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-07-20 02:06:42,888 INFO L87 Difference]: Start difference. First operand 1776 states and 2284 transitions. Second operand 18 states. [2020-07-20 02:06:43,090 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:43,251 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:44,810 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:46,834 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:47,138 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:06:48,720 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:48,885 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 02:06:49,035 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 02:06:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:06:49,494 INFO L93 Difference]: Finished difference Result 3632 states and 4636 transitions. [2020-07-20 02:06:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-20 02:06:49,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2020-07-20 02:06:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:06:49,509 INFO L225 Difference]: With dead ends: 3632 [2020-07-20 02:06:49,509 INFO L226 Difference]: Without dead ends: 2263 [2020-07-20 02:06:49,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2020-07-20 02:06:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2020-07-20 02:06:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1936. [2020-07-20 02:06:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2020-07-20 02:06:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2456 transitions. [2020-07-20 02:06:49,770 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2456 transitions. Word has length 141 [2020-07-20 02:06:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:06:49,772 INFO L479 AbstractCegarLoop]: Abstraction has 1936 states and 2456 transitions. [2020-07-20 02:06:49,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 02:06:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2456 transitions. [2020-07-20 02:06:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-07-20 02:06:49,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:06:49,775 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:06:49,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-20 02:06:49,775 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:06:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:06:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1694114410, now seen corresponding path program 1 times [2020-07-20 02:06:49,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:06:49,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647183614] [2020-07-20 02:06:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:06:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,034 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:06:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:06:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 02:06:50,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647183614] [2020-07-20 02:06:50,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:06:50,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-20 02:06:50,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734900986] [2020-07-20 02:06:50,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 02:06:50,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:06:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 02:06:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:06:50,422 INFO L87 Difference]: Start difference. First operand 1936 states and 2456 transitions. Second operand 19 states. [2020-07-20 02:06:50,638 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 02:06:50,824 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:52,218 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:06:53,250 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:55,005 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:55,353 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:55,528 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:06:55,720 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:55,878 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-20 02:06:56,074 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:06:58,932 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-20 02:06:59,885 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:07:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:00,109 INFO L93 Difference]: Finished difference Result 5009 states and 6334 transitions. [2020-07-20 02:07:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-07-20 02:07:00,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2020-07-20 02:07:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:00,134 INFO L225 Difference]: With dead ends: 5009 [2020-07-20 02:07:00,134 INFO L226 Difference]: Without dead ends: 3536 [2020-07-20 02:07:00,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2020-07-20 02:07:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2020-07-20 02:07:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2396. [2020-07-20 02:07:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2020-07-20 02:07:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3033 transitions. [2020-07-20 02:07:00,460 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3033 transitions. Word has length 145 [2020-07-20 02:07:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:00,460 INFO L479 AbstractCegarLoop]: Abstraction has 2396 states and 3033 transitions. [2020-07-20 02:07:00,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 02:07:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3033 transitions. [2020-07-20 02:07:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-07-20 02:07:00,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:00,463 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:00,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-20 02:07:00,464 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1220919060, now seen corresponding path program 1 times [2020-07-20 02:07:00,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:00,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501618612] [2020-07-20 02:07:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,721 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:07:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-20 02:07:01,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501618612] [2020-07-20 02:07:01,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:07:01,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-20 02:07:01,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541381594] [2020-07-20 02:07:01,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 02:07:01,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:07:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 02:07:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-07-20 02:07:01,174 INFO L87 Difference]: Start difference. First operand 2396 states and 3033 transitions. Second operand 18 states. [2020-07-20 02:07:01,545 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-07-20 02:07:01,730 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 02:07:02,872 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-07-20 02:07:03,184 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-07-20 02:07:04,557 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-20 02:07:05,735 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-20 02:07:05,905 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-20 02:07:06,113 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-20 02:07:06,317 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-20 02:07:06,515 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-20 02:07:06,694 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-20 02:07:07,029 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-20 02:07:07,636 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-07-20 02:07:10,661 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-20 02:07:11,529 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-20 02:07:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:12,929 INFO L93 Difference]: Finished difference Result 6362 states and 8155 transitions. [2020-07-20 02:07:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-20 02:07:12,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 146 [2020-07-20 02:07:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:12,949 INFO L225 Difference]: With dead ends: 6362 [2020-07-20 02:07:12,950 INFO L226 Difference]: Without dead ends: 4305 [2020-07-20 02:07:12,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-07-20 02:07:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4305 states. [2020-07-20 02:07:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4305 to 2352. [2020-07-20 02:07:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2020-07-20 02:07:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 2954 transitions. [2020-07-20 02:07:13,313 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 2954 transitions. Word has length 146 [2020-07-20 02:07:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:13,314 INFO L479 AbstractCegarLoop]: Abstraction has 2352 states and 2954 transitions. [2020-07-20 02:07:13,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 02:07:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2954 transitions. [2020-07-20 02:07:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-07-20 02:07:13,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:13,317 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:13,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-20 02:07:13,317 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:13,317 INFO L82 PathProgramCache]: Analyzing trace with hash 169045689, now seen corresponding path program 1 times [2020-07-20 02:07:13,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:13,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177055857] [2020-07-20 02:07:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,490 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:07:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-20 02:07:13,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177055857] [2020-07-20 02:07:13,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:07:13,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-20 02:07:13,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393777964] [2020-07-20 02:07:13,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 02:07:13,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:07:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 02:07:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:07:13,792 INFO L87 Difference]: Start difference. First operand 2352 states and 2954 transitions. Second operand 14 states. [2020-07-20 02:07:13,941 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-20 02:07:14,897 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-20 02:07:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:20,277 INFO L93 Difference]: Finished difference Result 6614 states and 8421 transitions. [2020-07-20 02:07:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 02:07:20,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 146 [2020-07-20 02:07:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:20,300 INFO L225 Difference]: With dead ends: 6614 [2020-07-20 02:07:20,300 INFO L226 Difference]: Without dead ends: 4651 [2020-07-20 02:07:20,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-07-20 02:07:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-07-20 02:07:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4110. [2020-07-20 02:07:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4110 states. [2020-07-20 02:07:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 5198 transitions. [2020-07-20 02:07:20,734 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 5198 transitions. Word has length 146 [2020-07-20 02:07:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:20,734 INFO L479 AbstractCegarLoop]: Abstraction has 4110 states and 5198 transitions. [2020-07-20 02:07:20,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 02:07:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 5198 transitions. [2020-07-20 02:07:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-20 02:07:20,737 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:20,737 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:20,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-20 02:07:20,737 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 598250863, now seen corresponding path program 1 times [2020-07-20 02:07:20,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:20,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615571825] [2020-07-20 02:07:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:20,957 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:07:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-20 02:07:21,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615571825] [2020-07-20 02:07:21,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:07:21,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-20 02:07:21,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703085085] [2020-07-20 02:07:21,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 02:07:21,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:07:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 02:07:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-07-20 02:07:21,445 INFO L87 Difference]: Start difference. First operand 4110 states and 5198 transitions. Second operand 18 states. [2020-07-20 02:07:21,784 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-07-20 02:07:21,967 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 02:07:23,751 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-07-20 02:07:24,087 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-07-20 02:07:24,350 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-07-20 02:07:25,999 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-20 02:07:26,211 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-20 02:07:26,427 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-20 02:07:26,637 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-20 02:07:26,841 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-20 02:07:27,048 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-20 02:07:27,398 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-20 02:07:27,864 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-07-20 02:07:28,153 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2020-07-20 02:07:28,318 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-07-20 02:07:30,099 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-20 02:07:33,016 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-20 02:07:33,229 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-20 02:07:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:35,213 INFO L93 Difference]: Finished difference Result 9621 states and 12271 transitions. [2020-07-20 02:07:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-20 02:07:35,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-07-20 02:07:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:35,240 INFO L225 Difference]: With dead ends: 9621 [2020-07-20 02:07:35,241 INFO L226 Difference]: Without dead ends: 6024 [2020-07-20 02:07:35,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2020-07-20 02:07:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-07-20 02:07:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4715. [2020-07-20 02:07:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4715 states. [2020-07-20 02:07:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 5931 transitions. [2020-07-20 02:07:35,782 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 5931 transitions. Word has length 148 [2020-07-20 02:07:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:35,782 INFO L479 AbstractCegarLoop]: Abstraction has 4715 states and 5931 transitions. [2020-07-20 02:07:35,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 02:07:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 5931 transitions. [2020-07-20 02:07:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-20 02:07:35,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:35,786 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:35,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-20 02:07:35,786 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1683403018, now seen corresponding path program 1 times [2020-07-20 02:07:35,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:35,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524443727] [2020-07-20 02:07:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,062 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:07:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-20 02:07:36,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524443727] [2020-07-20 02:07:36,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:07:36,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-20 02:07:36,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766717541] [2020-07-20 02:07:36,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 02:07:36,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:07:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 02:07:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-07-20 02:07:36,724 INFO L87 Difference]: Start difference. First operand 4715 states and 5931 transitions. Second operand 17 states. [2020-07-20 02:07:36,974 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:07:37,359 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-07-20 02:07:37,731 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2020-07-20 02:07:38,205 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2020-07-20 02:07:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:41,649 INFO L93 Difference]: Finished difference Result 9413 states and 11847 transitions. [2020-07-20 02:07:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 02:07:41,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2020-07-20 02:07:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:41,673 INFO L225 Difference]: With dead ends: 9413 [2020-07-20 02:07:41,674 INFO L226 Difference]: Without dead ends: 4727 [2020-07-20 02:07:41,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2020-07-20 02:07:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4727 states. [2020-07-20 02:07:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4727 to 4723. [2020-07-20 02:07:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2020-07-20 02:07:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5939 transitions. [2020-07-20 02:07:42,347 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5939 transitions. Word has length 149 [2020-07-20 02:07:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:42,348 INFO L479 AbstractCegarLoop]: Abstraction has 4723 states and 5939 transitions. [2020-07-20 02:07:42,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 02:07:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5939 transitions. [2020-07-20 02:07:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-20 02:07:42,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:42,351 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:42,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-20 02:07:42,351 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2140207928, now seen corresponding path program 1 times [2020-07-20 02:07:42,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:42,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088561684] [2020-07-20 02:07:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,646 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:07:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-20 02:07:43,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088561684] [2020-07-20 02:07:43,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:07:43,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-20 02:07:43,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390450444] [2020-07-20 02:07:43,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 02:07:43,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:07:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 02:07:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:07:43,114 INFO L87 Difference]: Start difference. First operand 4723 states and 5939 transitions. Second operand 19 states. [2020-07-20 02:07:43,280 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 02:07:43,829 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 137 [2020-07-20 02:07:44,042 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-07-20 02:07:44,373 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:07:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:49,778 INFO L93 Difference]: Finished difference Result 9230 states and 11625 transitions. [2020-07-20 02:07:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-07-20 02:07:49,779 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 149 [2020-07-20 02:07:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:49,794 INFO L225 Difference]: With dead ends: 9230 [2020-07-20 02:07:49,794 INFO L226 Difference]: Without dead ends: 4768 [2020-07-20 02:07:49,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2020-07-20 02:07:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2020-07-20 02:07:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4723. [2020-07-20 02:07:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2020-07-20 02:07:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5921 transitions. [2020-07-20 02:07:50,510 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5921 transitions. Word has length 149 [2020-07-20 02:07:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:50,511 INFO L479 AbstractCegarLoop]: Abstraction has 4723 states and 5921 transitions. [2020-07-20 02:07:50,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 02:07:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5921 transitions. [2020-07-20 02:07:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 02:07:50,514 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:50,514 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:50,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-20 02:07:50,514 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1896255881, now seen corresponding path program 1 times [2020-07-20 02:07:50,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:50,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311053606] [2020-07-20 02:07:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,690 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-20 02:07:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:07:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-20 02:07:51,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311053606] [2020-07-20 02:07:51,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:07:51,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-20 02:07:51,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911369708] [2020-07-20 02:07:51,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 02:07:51,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:07:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 02:07:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-20 02:07:51,008 INFO L87 Difference]: Start difference. First operand 4723 states and 5921 transitions. Second operand 16 states. [2020-07-20 02:07:51,146 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-20 02:07:51,466 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-20 02:07:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:07:55,768 INFO L93 Difference]: Finished difference Result 9173 states and 11526 transitions. [2020-07-20 02:07:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 02:07:55,769 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 150 [2020-07-20 02:07:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:07:55,787 INFO L225 Difference]: With dead ends: 9173 [2020-07-20 02:07:55,787 INFO L226 Difference]: Without dead ends: 4741 [2020-07-20 02:07:55,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-07-20 02:07:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2020-07-20 02:07:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4723. [2020-07-20 02:07:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2020-07-20 02:07:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5915 transitions. [2020-07-20 02:07:56,419 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5915 transitions. Word has length 150 [2020-07-20 02:07:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:07:56,419 INFO L479 AbstractCegarLoop]: Abstraction has 4723 states and 5915 transitions. [2020-07-20 02:07:56,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 02:07:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5915 transitions. [2020-07-20 02:07:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 02:07:56,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:07:56,423 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:07:56,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-20 02:07:56,424 INFO L427 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:07:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:07:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash 712531577, now seen corresponding path program 1 times [2020-07-20 02:07:56,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:07:56,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518102737] [2020-07-20 02:07:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7e2e2e73 [2020-07-20 02:07:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:07:56,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:07:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:07:56,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:07:56,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 02:07:56,727 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 02:07:56,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-20 02:07:56,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:07:56 BoogieIcfgContainer [2020-07-20 02:07:56,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 02:07:56,948 INFO L168 Benchmark]: Toolchain (without parser) took 145975.42 ms. Allocated memory was 139.5 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 103.8 MB in the beginning and 969.3 MB in the end (delta: -865.5 MB). Peak memory consumption was 165.7 MB. Max. memory is 7.1 GB. [2020-07-20 02:07:56,948 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 02:07:56,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.10 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 103.3 MB in the beginning and 176.4 MB in the end (delta: -73.0 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-07-20 02:07:56,949 INFO L168 Benchmark]: Boogie Preprocessor took 84.38 ms. Allocated memory is still 203.4 MB. Free memory was 176.4 MB in the beginning and 173.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-20 02:07:56,949 INFO L168 Benchmark]: RCFGBuilder took 964.11 ms. Allocated memory is still 203.4 MB. Free memory was 173.0 MB in the beginning and 109.7 MB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2020-07-20 02:07:56,950 INFO L168 Benchmark]: TraceAbstraction took 144364.23 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 967.3 MB). Free memory was 109.0 MB in the beginning and 969.3 MB in the end (delta: -860.3 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. [2020-07-20 02:07:56,952 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 555.10 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 103.3 MB in the beginning and 176.4 MB in the end (delta: -73.0 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.38 ms. Allocated memory is still 203.4 MB. Free memory was 176.4 MB in the beginning and 173.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 964.11 ms. Allocated memory is still 203.4 MB. Free memory was 173.0 MB in the beginning and 109.7 MB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144364.23 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 967.3 MB). Free memory was 109.0 MB in the beginning and 969.3 MB in the end (delta: -860.3 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 664]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L105] static _Bool side1Failed_History_0 ; [L106] static _Bool side1Failed_History_1 ; [L107] static _Bool side1Failed_History_2 ; [L108] static _Bool side2Failed_History_0 ; [L109] static _Bool side2Failed_History_1 ; [L110] static _Bool side2Failed_History_2 ; [L111] static int8_t active_side_History_0 ; [L112] static int8_t active_side_History_1 ; [L113] static int8_t active_side_History_2 ; [L114] static msg_t manual_selection_History_0 ; [L115] static msg_t manual_selection_History_1 ; [L116] static msg_t manual_selection_History_2 ; [L466] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [\old(active_side_History_0)=167, \old(active_side_History_1)=155, \old(active_side_History_2)=142, \old(cs1)=148, \old(cs1_new)=140, \old(cs1_old)=161, \old(cs2)=164, \old(cs2_new)=138, \old(cs2_old)=157, \old(manual_selection_History_0)=163, \old(manual_selection_History_1)=152, \old(manual_selection_History_2)=146, \old(nomsg)=147, \old(s1p)=165, \old(s1p_new)=136, \old(s1p_old)=131, \old(s1s1)=132, \old(s1s1_new)=168, \old(s1s1_old)=143, \old(s1s2)=128, \old(s1s2_new)=166, \old(s1s2_old)=137, \old(s2p)=151, \old(s2p_new)=153, \old(s2p_old)=149, \old(s2s1)=156, \old(s2s1_new)=144, \old(s2s1_old)=162, \old(s2s2)=145, \old(s2s2_new)=160, \old(s2s2_old)=169, \old(side1_written)=135, \old(side1Failed)=133, \old(side1Failed_History_0)=159, \old(side1Failed_History_1)=170, \old(side1Failed_History_2)=134, \old(side2_written)=129, \old(side2Failed)=158, \old(side2Failed_History_0)=130, \old(side2Failed_History_1)=139, \old(side2Failed_History_2)=154, active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L588] int c1 ; [L589] int i2 ; [L592] c1 = 0 [L593] side1Failed = __VERIFIER_nondet_bool() [L594] side2Failed = __VERIFIER_nondet_bool() [L595] side1_written = __VERIFIER_nondet_char() [L596] side2_written = __VERIFIER_nondet_char() [L597] side1Failed_History_0 = __VERIFIER_nondet_bool() [L598] side1Failed_History_1 = __VERIFIER_nondet_bool() [L599] side1Failed_History_2 = __VERIFIER_nondet_bool() [L600] side2Failed_History_0 = __VERIFIER_nondet_bool() [L601] side2Failed_History_1 = __VERIFIER_nondet_bool() [L602] side2Failed_History_2 = __VERIFIER_nondet_bool() [L603] active_side_History_0 = __VERIFIER_nondet_char() [L604] active_side_History_1 = __VERIFIER_nondet_char() [L605] active_side_History_2 = __VERIFIER_nondet_char() [L606] manual_selection_History_0 = __VERIFIER_nondet_char() [L607] manual_selection_History_1 = __VERIFIER_nondet_char() [L608] manual_selection_History_2 = __VERIFIER_nondet_char() [L609] CALL, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L242] COND FALSE !((int )side1Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L245] COND FALSE !((int )side2Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L248] COND FALSE !((int )active_side_History_0 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L251] COND FALSE !((int )manual_selection_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L254] COND FALSE !((int )side1Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L257] COND FALSE !((int )side2Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L260] COND FALSE !((int )active_side_History_1 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L263] COND FALSE !((int )manual_selection_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] COND FALSE !((int )side1Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L269] COND FALSE !((int )side2Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L272] COND FALSE !((int )active_side_History_2 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L275] COND FALSE !((int )manual_selection_History_2 != 0) [L278] return (1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] RET, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, init()=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] i2 = init() [L610] CALL assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L610] RET assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] cs1_old = nomsg [L612] cs1_new = nomsg [L613] cs2_old = nomsg [L614] cs2_new = nomsg [L615] s1s2_old = nomsg [L616] s1s2_new = nomsg [L617] s1s1_old = nomsg [L618] s1s1_new = nomsg [L619] s2s1_old = nomsg [L620] s2s1_new = nomsg [L621] s2s2_old = nomsg [L622] s2s2_new = nomsg [L623] s1p_old = nomsg [L624] s1p_new = nomsg [L625] s2p_old = nomsg [L626] s2p_new = nomsg [L627] i2 = 0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L628] COND TRUE 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] CALL Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L296] msg_t manual_selection ; [L297] char tmp ; [L300] tmp = __VERIFIER_nondet_char() [L301] manual_selection = tmp VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L302] CALL write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=127, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] manual_selection_History_2 = manual_selection_History_1 [L213] manual_selection_History_1 = manual_selection_History_0 [L214] manual_selection_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=127, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=127] [L302] RET write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L303] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=127, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L303] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L304] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=127, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L304] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L305] manual_selection = (msg_t )0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L630] RET Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] CALL Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=141, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L311] int8_t side1 ; [L312] int8_t side2 ; [L313] msg_t manual_selection ; [L314] int8_t next_state ; [L317] side1 = nomsg [L318] side2 = nomsg [L319] manual_selection = (msg_t )0 [L320] side1Failed = __VERIFIER_nondet_bool() [L321] CALL write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L122] side1Failed_History_2 = side1Failed_History_1 [L123] side1Failed_History_1 = side1Failed_History_0 [L124] side1Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L321] RET write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] COND FALSE !(\read(side1Failed)) [L329] side1 = s1s1_old [L330] s1s1_old = nomsg [L331] side2 = s2s1_old [L332] s2s1_old = nomsg [L333] manual_selection = cs1_old [L334] cs1_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] COND TRUE (int )side1 == (int )side2 [L336] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L360] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L360] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L361] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L362] side1_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=141, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] RET Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] CALL Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=150, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L368] int8_t side1 ; [L369] int8_t side2 ; [L370] msg_t manual_selection ; [L371] int8_t next_state ; [L374] side1 = nomsg [L375] side2 = nomsg [L376] manual_selection = (msg_t )0 [L377] side2Failed = __VERIFIER_nondet_bool() [L378] CALL write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L152] side2Failed_History_2 = side2Failed_History_1 [L153] side2Failed_History_1 = side2Failed_History_0 [L154] side2Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L378] RET write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L379] COND FALSE !(\read(side2Failed)) [L386] side1 = s1s2_old [L387] s1s2_old = nomsg [L388] side2 = s2s2_old [L389] s2s2_old = nomsg [L390] manual_selection = cs2_old [L391] cs2_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L392] COND TRUE (int )side1 == (int )side2 [L393] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L416] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L416] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L417] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L417] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L418] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L419] side2_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=150, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] RET Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] CALL Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L425] int8_t active_side ; [L426] int8_t tmp ; [L427] int8_t side1 ; [L428] int8_t side2 ; VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L193] COND TRUE (int )index == 0 [L194] return (active_side_History_0); VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] RET, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] tmp = read_active_side_history((unsigned char)0) [L432] active_side = tmp [L433] side1 = nomsg [L434] side2 = nomsg [L435] side1 = s1p_old [L436] s1p_old = nomsg [L437] side2 = s2p_old [L438] s2p_old = nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L439] COND FALSE !((int )side1 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L442] COND FALSE !((int )side2 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L445] COND FALSE !((int )side1 == 0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L453] COND TRUE (int )side1 == (int )nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L454] COND FALSE !((int )side2 == 0) [L457] active_side = (int8_t )0 VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L462] CALL write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L182] active_side_History_2 = active_side_History_1 [L183] active_side_History_1 = active_side_History_0 [L184] active_side_History_0 = val VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L462] RET write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L633] RET Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L634] cs1_old = cs1_new [L635] cs1_new = nomsg [L636] cs2_old = cs2_new [L637] cs2_new = nomsg [L638] s1s2_old = s1s2_new [L639] s1s2_new = nomsg [L640] s1s1_old = s1s1_new [L641] s1s1_new = nomsg [L642] s2s1_old = s2s1_new [L643] s2s1_new = nomsg [L644] s2s2_old = s2s2_new [L645] s2s2_new = nomsg [L646] s1p_old = s1p_new [L647] s1p_new = nomsg [L648] s2p_old = s2p_new [L649] s2p_new = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L650] CALL, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L469] int tmp ; [L470] msg_t tmp___0 ; [L471] _Bool tmp___1 ; [L472] _Bool tmp___2 ; [L473] _Bool tmp___3 ; [L474] _Bool tmp___4 ; [L475] int8_t tmp___5 ; [L476] _Bool tmp___6 ; [L477] _Bool tmp___7 ; [L478] _Bool tmp___8 ; [L479] int8_t tmp___9 ; [L480] _Bool tmp___10 ; [L481] _Bool tmp___11 ; [L482] _Bool tmp___12 ; [L483] msg_t tmp___13 ; [L484] _Bool tmp___14 ; [L485] _Bool tmp___15 ; [L486] _Bool tmp___16 ; [L487] _Bool tmp___17 ; [L488] int8_t tmp___18 ; [L489] int8_t tmp___19 ; [L490] int8_t tmp___20 ; VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L493] COND TRUE ! side1Failed [L494] tmp = 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L501] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L501] RET assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L502] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L223] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L226] COND TRUE (int )index == 1 [L227] return (manual_selection_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L502] tmp___0 = read_manual_selection_history((unsigned char)1) [L503] COND TRUE ! tmp___0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L504] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L136] COND TRUE (int )index == 1 [L137] return (side1Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L504] tmp___1 = read_side1_failed_history((unsigned char)1) [L505] COND TRUE ! tmp___1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L506] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 0 [L134] return (side1Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L506] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L506] tmp___2 = read_side1_failed_history((unsigned char)0) [L507] COND TRUE ! tmp___2 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L508] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L166] COND TRUE (int )index == 1 [L167] return (side2Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L508] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L508] tmp___3 = read_side2_failed_history((unsigned char)1) [L509] COND TRUE ! tmp___3 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L510] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND TRUE (int )index == 0 [L164] return (side2Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L510] tmp___4 = read_side2_failed_history((unsigned char)0) [L511] COND TRUE ! tmp___4 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L512] COND FALSE !(! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L517] COND FALSE !(! (! ((int )side1_written == 0))) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L522] COND TRUE ! (! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L523] COND TRUE ! ((int )side2_written == 0) [L524] return (0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L650] RET, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, check()=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L650] c1 = check() [L651] CALL assert(c1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L662] COND TRUE ! arg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L664] __VERIFIER_error() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 144.0s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 123.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7416 SDtfs, 34886 SDslu, 3783 SDs, 0 SdLazy, 43513 SolverSat, 12909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1543 GetRequests, 778 SyntacticMatches, 15 SemanticMatches, 750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5065 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4723occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 5589 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 3218 NumberOfCodeBlocks, 3218 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3043 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 187/187 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...