/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:36:28,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:36:28,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:36:28,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:36:28,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:36:28,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:36:28,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:36:28,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:36:28,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:36:28,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:36:28,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:36:28,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:36:28,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:36:28,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:36:28,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:36:28,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:36:28,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:36:28,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:36:28,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:36:28,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:36:28,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:36:28,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:36:28,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:36:28,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:36:28,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:36:28,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:36:28,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:36:28,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:36:28,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:36:28,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:36:28,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:36:28,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:36:28,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:36:28,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:36:28,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:36:28,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:36:28,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:36:28,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:36:28,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:36:28,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:36:28,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:36:28,216 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-07 11:36:28,231 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:36:28,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:36:28,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:36:28,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:36:28,233 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:36:28,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:36:28,233 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:36:28,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:36:28,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:36:28,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:36:28,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:36:28,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:36:28,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:36:28,235 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:36:28,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:36:28,235 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:36:28,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:36:28,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:36:28,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:36:28,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:36:28,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:36:28,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:36:28,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:36:28,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:36:28,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:36:28,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:36:28,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:36:28,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:36:28,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:36:28,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:36:28,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:36:28,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:36:28,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:36:28,549 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:36:28,550 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:36:28,550 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.BOUNDED-10.pals.c [2020-07-07 11:36:28,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7addb4ad2/3f5a4926fe21446daa54d05c0394b0fd/FLAG4c327ad89 [2020-07-07 11:36:29,114 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:36:29,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-07-07 11:36:29,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7addb4ad2/3f5a4926fe21446daa54d05c0394b0fd/FLAG4c327ad89 [2020-07-07 11:36:29,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7addb4ad2/3f5a4926fe21446daa54d05c0394b0fd [2020-07-07 11:36:29,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:36:29,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:36:29,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:36:29,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:36:29,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:36:29,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:36:29" (1/1) ... [2020-07-07 11:36:29,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727070f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:29, skipping insertion in model container [2020-07-07 11:36:29,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:36:29" (1/1) ... [2020-07-07 11:36:29,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:36:29,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:36:29,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:36:29,993 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:36:30,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:36:30,101 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:36:30,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30 WrapperNode [2020-07-07 11:36:30,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:36:30,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:36:30,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:36:30,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:36:30,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (1/1) ... [2020-07-07 11:36:30,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:36:30,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:36:30,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:36:30,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:36:30,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (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-07 11:36:30,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:36:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:36:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-07 11:36:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-07-07 11:36:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-07-07 11:36:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-07 11:36:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-07-07 11:36:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-07-07 11:36:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-07-07 11:36:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-07-07 11:36:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-07-07 11:36:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-07 11:36:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:36:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-07-07 11:36:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:36:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-07 11:36:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-07 11:36:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-07-07 11:36:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-07-07 11:36:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-07-07 11:36:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-07-07 11:36:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-07-07 11:36:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-07-07 11:36:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-07-07 11:36:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-07 11:36:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-07-07 11:36:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-07-07 11:36:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-07-07 11:36:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-07-07 11:36:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-07-07 11:36:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-07 11:36:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:36:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:36:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:36:31,105 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:36:31,106 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 11:36:31,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:36:31 BoogieIcfgContainer [2020-07-07 11:36:31,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:36:31,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:36:31,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:36:31,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:36:31,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:36:29" (1/3) ... [2020-07-07 11:36:31,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8b9aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:36:31, skipping insertion in model container [2020-07-07 11:36:31,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:30" (2/3) ... [2020-07-07 11:36:31,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8b9aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:36:31, skipping insertion in model container [2020-07-07 11:36:31,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:36:31" (3/3) ... [2020-07-07 11:36:31,122 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-07-07 11:36:31,134 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:36:31,143 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:36:31,158 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:36:31,185 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:36:31,185 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:36:31,185 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:36:31,185 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:36:31,186 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:36:31,186 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:36:31,186 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:36:31,186 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:36:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2020-07-07 11:36:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-07 11:36:31,225 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:31,226 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-07 11:36:31,227 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1541207534, now seen corresponding path program 1 times [2020-07-07 11:36:31,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:31,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269215940] [2020-07-07 11:36:31,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,784 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:32,148 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-07 11:36:32,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269215940] [2020-07-07 11:36:32,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:36:32,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185657611] [2020-07-07 11:36:32,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:36:32,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:36:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:32,176 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 9 states. [2020-07-07 11:36:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:33,821 INFO L93 Difference]: Finished difference Result 463 states and 711 transitions. [2020-07-07 11:36:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:36:33,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-07-07 11:36:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:33,839 INFO L225 Difference]: With dead ends: 463 [2020-07-07 11:36:33,839 INFO L226 Difference]: Without dead ends: 238 [2020-07-07 11:36:33,847 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-07 11:36:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-07 11:36:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-07-07 11:36:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-07 11:36:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2020-07-07 11:36:33,939 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 71 [2020-07-07 11:36:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:33,940 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2020-07-07 11:36:33,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:36:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2020-07-07 11:36:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-07 11:36:33,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:33,944 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-07 11:36:33,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:36:33,945 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -508602450, now seen corresponding path program 1 times [2020-07-07 11:36:33,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:33,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076299019] [2020-07-07 11:36:33,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,244 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,519 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-07 11:36:34,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076299019] [2020-07-07 11:36:34,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:34,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 11:36:34,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583959592] [2020-07-07 11:36:34,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:36:34,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:34,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:36:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:36:34,523 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand 14 states. [2020-07-07 11:36:34,693 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:36:34,926 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:36:35,085 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:36:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:37,668 INFO L93 Difference]: Finished difference Result 467 states and 671 transitions. [2020-07-07 11:36:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:36:37,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-07-07 11:36:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:37,679 INFO L225 Difference]: With dead ends: 467 [2020-07-07 11:36:37,680 INFO L226 Difference]: Without dead ends: 248 [2020-07-07 11:36:37,686 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-07 11:36:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-07 11:36:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 238. [2020-07-07 11:36:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-07 11:36:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 331 transitions. [2020-07-07 11:36:37,749 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 331 transitions. Word has length 71 [2020-07-07 11:36:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:37,750 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 331 transitions. [2020-07-07 11:36:37,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:36:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 331 transitions. [2020-07-07 11:36:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-07 11:36:37,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:37,753 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-07 11:36:37,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:36:37,753 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1489036951, now seen corresponding path program 1 times [2020-07-07 11:36:37,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:37,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198796195] [2020-07-07 11:36:37,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:37,989 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:38,193 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-07 11:36:38,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198796195] [2020-07-07 11:36:38,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:38,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 11:36:38,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538955338] [2020-07-07 11:36:38,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:36:38,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:38,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:36:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:38,196 INFO L87 Difference]: Start difference. First operand 238 states and 331 transitions. Second operand 11 states. [2020-07-07 11:36:39,189 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:36:39,344 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:36:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:40,464 INFO L93 Difference]: Finished difference Result 456 states and 647 transitions. [2020-07-07 11:36:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:36:40,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-07-07 11:36:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:40,468 INFO L225 Difference]: With dead ends: 456 [2020-07-07 11:36:40,468 INFO L226 Difference]: Without dead ends: 242 [2020-07-07 11:36:40,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:36:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-07 11:36:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-07-07 11:36:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-07-07 11:36:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2020-07-07 11:36:40,502 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 82 [2020-07-07 11:36:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:40,502 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2020-07-07 11:36:40,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:36:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2020-07-07 11:36:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-07 11:36:40,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:40,505 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-07 11:36:40,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:36:40,506 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2124611218, now seen corresponding path program 1 times [2020-07-07 11:36:40,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:40,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932076713] [2020-07-07 11:36:40,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,768 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,142 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-07 11:36:41,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932076713] [2020-07-07 11:36:41,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:41,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 11:36:41,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353766708] [2020-07-07 11:36:41,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 11:36:41,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:41,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 11:36:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-07 11:36:41,148 INFO L87 Difference]: Start difference. First operand 242 states and 334 transitions. Second operand 16 states. [2020-07-07 11:36:41,314 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:36:43,223 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:36:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:45,031 INFO L93 Difference]: Finished difference Result 551 states and 760 transitions. [2020-07-07 11:36:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 11:36:45,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-07-07 11:36:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:45,037 INFO L225 Difference]: With dead ends: 551 [2020-07-07 11:36:45,037 INFO L226 Difference]: Without dead ends: 333 [2020-07-07 11:36:45,039 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-07 11:36:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-07-07 11:36:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-07-07 11:36:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-07-07 11:36:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-07-07 11:36:45,075 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 104 [2020-07-07 11:36:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:45,076 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-07-07 11:36:45,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 11:36:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-07-07 11:36:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-07 11:36:45,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:45,078 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-07 11:36:45,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:36:45,079 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1802435784, now seen corresponding path program 1 times [2020-07-07 11:36:45,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:45,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829864866] [2020-07-07 11:36:45,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,282 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:45,593 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-07 11:36:45,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829864866] [2020-07-07 11:36:45,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:45,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 11:36:45,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266678876] [2020-07-07 11:36:45,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 11:36:45,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:45,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 11:36:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-07 11:36:45,597 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 16 states. [2020-07-07 11:36:45,765 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:36:47,534 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:36:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:49,479 INFO L93 Difference]: Finished difference Result 557 states and 768 transitions. [2020-07-07 11:36:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 11:36:49,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-07-07 11:36:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:49,483 INFO L225 Difference]: With dead ends: 557 [2020-07-07 11:36:49,483 INFO L226 Difference]: Without dead ends: 336 [2020-07-07 11:36:49,485 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-07 11:36:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-07-07 11:36:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2020-07-07 11:36:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-07-07 11:36:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-07-07 11:36:49,521 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 105 [2020-07-07 11:36:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:49,522 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-07-07 11:36:49,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 11:36:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-07-07 11:36:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-07 11:36:49,524 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:49,524 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-07 11:36:49,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:36:49,525 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1848316150, now seen corresponding path program 1 times [2020-07-07 11:36:49,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:49,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543600603] [2020-07-07 11:36:49,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,724 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,012 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-07 11:36:50,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543600603] [2020-07-07 11:36:50,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:50,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:36:50,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158422257] [2020-07-07 11:36:50,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:36:50,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:36:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:50,018 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 12 states. [2020-07-07 11:36:50,783 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:36:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:53,716 INFO L93 Difference]: Finished difference Result 791 states and 1096 transitions. [2020-07-07 11:36:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 11:36:53,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-07-07 11:36:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:53,722 INFO L225 Difference]: With dead ends: 791 [2020-07-07 11:36:53,722 INFO L226 Difference]: Without dead ends: 570 [2020-07-07 11:36:53,724 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-07 11:36:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-07-07 11:36:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2020-07-07 11:36:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-07-07 11:36:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 760 transitions. [2020-07-07 11:36:53,812 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 760 transitions. Word has length 107 [2020-07-07 11:36:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:53,814 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 760 transitions. [2020-07-07 11:36:53,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:36:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 760 transitions. [2020-07-07 11:36:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-07 11:36:53,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:53,817 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-07 11:36:53,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:36:53,817 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -723997746, now seen corresponding path program 1 times [2020-07-07 11:36:53,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:53,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838515622] [2020-07-07 11:36:53,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,010 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:36:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,293 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-07 11:36:54,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838515622] [2020-07-07 11:36:54,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:54,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:36:54,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304116891] [2020-07-07 11:36:54,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:36:54,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:36:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:54,296 INFO L87 Difference]: Start difference. First operand 552 states and 760 transitions. Second operand 12 states. [2020-07-07 11:36:54,443 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:36:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:57,983 INFO L93 Difference]: Finished difference Result 968 states and 1350 transitions. [2020-07-07 11:36:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 11:36:57,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-07-07 11:36:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:57,988 INFO L225 Difference]: With dead ends: 968 [2020-07-07 11:36:57,988 INFO L226 Difference]: Without dead ends: 570 [2020-07-07 11:36:57,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 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-07 11:36:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-07-07 11:36:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2020-07-07 11:36:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-07-07 11:36:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 758 transitions. [2020-07-07 11:36:58,050 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 758 transitions. Word has length 109 [2020-07-07 11:36:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:58,050 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 758 transitions. [2020-07-07 11:36:58,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:36:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 758 transitions. [2020-07-07 11:36:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-07 11:36:58,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:58,052 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-07 11:36:58,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:36:58,053 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1067489879, now seen corresponding path program 1 times [2020-07-07 11:36:58,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:58,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073538697] [2020-07-07 11:36:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,458 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-07 11:36:58,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073538697] [2020-07-07 11:36:58,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:58,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:36:58,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787123604] [2020-07-07 11:36:58,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:36:58,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:36:58,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:58,462 INFO L87 Difference]: Start difference. First operand 552 states and 758 transitions. Second operand 12 states. [2020-07-07 11:36:59,556 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:02,161 INFO L93 Difference]: Finished difference Result 1311 states and 1841 transitions. [2020-07-07 11:37:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 11:37:02,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-07-07 11:37:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:02,169 INFO L225 Difference]: With dead ends: 1311 [2020-07-07 11:37:02,169 INFO L226 Difference]: Without dead ends: 913 [2020-07-07 11:37:02,172 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-07 11:37:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2020-07-07 11:37:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 907. [2020-07-07 11:37:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2020-07-07 11:37:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1263 transitions. [2020-07-07 11:37:02,304 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1263 transitions. Word has length 108 [2020-07-07 11:37:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:02,305 INFO L479 AbstractCegarLoop]: Abstraction has 907 states and 1263 transitions. [2020-07-07 11:37:02,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:37:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1263 transitions. [2020-07-07 11:37:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-07 11:37:02,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:02,309 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-07 11:37:02,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 11:37:02,310 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -212373799, now seen corresponding path program 1 times [2020-07-07 11:37:02,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:02,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131434357] [2020-07-07 11:37:02,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,585 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,817 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-07 11:37:02,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131434357] [2020-07-07 11:37:02,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:02,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:02,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288505419] [2020-07-07 11:37:02,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:02,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:02,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:02,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:02,820 INFO L87 Difference]: Start difference. First operand 907 states and 1263 transitions. Second operand 13 states. [2020-07-07 11:37:04,183 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:04,320 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:05,318 INFO L93 Difference]: Finished difference Result 1662 states and 2348 transitions. [2020-07-07 11:37:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:37:05,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-07-07 11:37:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:05,325 INFO L225 Difference]: With dead ends: 1662 [2020-07-07 11:37:05,325 INFO L226 Difference]: Without dead ends: 927 [2020-07-07 11:37:05,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 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-07 11:37:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-07-07 11:37:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2020-07-07 11:37:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-07-07 11:37:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1279 transitions. [2020-07-07 11:37:05,432 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1279 transitions. Word has length 108 [2020-07-07 11:37:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:05,432 INFO L479 AbstractCegarLoop]: Abstraction has 927 states and 1279 transitions. [2020-07-07 11:37:05,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1279 transitions. [2020-07-07 11:37:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-07-07 11:37:05,435 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:05,435 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-07 11:37:05,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 11:37:05,435 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:05,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1747753163, now seen corresponding path program 1 times [2020-07-07 11:37:05,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:05,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643903729] [2020-07-07 11:37:05,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,671 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,917 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-07 11:37:05,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643903729] [2020-07-07 11:37:05,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:05,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:05,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685810706] [2020-07-07 11:37:05,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:05,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:05,920 INFO L87 Difference]: Start difference. First operand 927 states and 1279 transitions. Second operand 13 states. [2020-07-07 11:37:07,375 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:07,549 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:08,516 INFO L93 Difference]: Finished difference Result 1702 states and 2392 transitions. [2020-07-07 11:37:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:37:08,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-07-07 11:37:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:08,523 INFO L225 Difference]: With dead ends: 1702 [2020-07-07 11:37:08,524 INFO L226 Difference]: Without dead ends: 947 [2020-07-07 11:37:08,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 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-07 11:37:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2020-07-07 11:37:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2020-07-07 11:37:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2020-07-07 11:37:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1295 transitions. [2020-07-07 11:37:08,630 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1295 transitions. Word has length 116 [2020-07-07 11:37:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:08,630 INFO L479 AbstractCegarLoop]: Abstraction has 947 states and 1295 transitions. [2020-07-07 11:37:08,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1295 transitions. [2020-07-07 11:37:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-07 11:37:08,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:08,633 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-07 11:37:08,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 11:37:08,634 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1289634625, now seen corresponding path program 1 times [2020-07-07 11:37:08,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:08,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677289893] [2020-07-07 11:37:08,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,831 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,097 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-07 11:37:09,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677289893] [2020-07-07 11:37:09,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:09,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:09,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21379764] [2020-07-07 11:37:09,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:09,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:09,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:09,100 INFO L87 Difference]: Start difference. First operand 947 states and 1295 transitions. Second operand 13 states. [2020-07-07 11:37:10,776 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:10,919 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:11,667 INFO L93 Difference]: Finished difference Result 1738 states and 2408 transitions. [2020-07-07 11:37:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:37:11,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-07-07 11:37:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:11,674 INFO L225 Difference]: With dead ends: 1738 [2020-07-07 11:37:11,674 INFO L226 Difference]: Without dead ends: 963 [2020-07-07 11:37:11,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 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-07 11:37:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2020-07-07 11:37:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2020-07-07 11:37:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-07-07 11:37:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1307 transitions. [2020-07-07 11:37:11,779 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1307 transitions. Word has length 124 [2020-07-07 11:37:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:11,780 INFO L479 AbstractCegarLoop]: Abstraction has 963 states and 1307 transitions. [2020-07-07 11:37:11,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1307 transitions. [2020-07-07 11:37:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-07 11:37:11,782 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:11,783 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-07 11:37:11,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 11:37:11,783 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1471497757, now seen corresponding path program 1 times [2020-07-07 11:37:11,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:11,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638636040] [2020-07-07 11:37:11,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,018 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:12,235 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-07 11:37:12,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638636040] [2020-07-07 11:37:12,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:12,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:12,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129592300] [2020-07-07 11:37:12,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:12,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:12,238 INFO L87 Difference]: Start difference. First operand 963 states and 1307 transitions. Second operand 13 states. [2020-07-07 11:37:13,759 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:13,895 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:14,690 INFO L93 Difference]: Finished difference Result 1774 states and 2448 transitions. [2020-07-07 11:37:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:37:14,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-07-07 11:37:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:14,698 INFO L225 Difference]: With dead ends: 1774 [2020-07-07 11:37:14,698 INFO L226 Difference]: Without dead ends: 983 [2020-07-07 11:37:14,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 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-07 11:37:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2020-07-07 11:37:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2020-07-07 11:37:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2020-07-07 11:37:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1323 transitions. [2020-07-07 11:37:14,805 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1323 transitions. Word has length 124 [2020-07-07 11:37:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:14,806 INFO L479 AbstractCegarLoop]: Abstraction has 983 states and 1323 transitions. [2020-07-07 11:37:14,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1323 transitions. [2020-07-07 11:37:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-07-07 11:37:14,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:14,810 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-07 11:37:14,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 11:37:14,811 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash -406565793, now seen corresponding path program 1 times [2020-07-07 11:37:14,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:14,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210529056] [2020-07-07 11:37:14,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,039 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:15,392 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-07 11:37:15,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210529056] [2020-07-07 11:37:15,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:15,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:15,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501651502] [2020-07-07 11:37:15,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:15,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:15,396 INFO L87 Difference]: Start difference. First operand 983 states and 1323 transitions. Second operand 13 states. [2020-07-07 11:37:17,147 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:17,289 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:17,859 INFO L93 Difference]: Finished difference Result 1818 states and 2476 transitions. [2020-07-07 11:37:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:37:17,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2020-07-07 11:37:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:17,866 INFO L225 Difference]: With dead ends: 1818 [2020-07-07 11:37:17,866 INFO L226 Difference]: Without dead ends: 1007 [2020-07-07 11:37:17,869 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-07 11:37:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2020-07-07 11:37:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2020-07-07 11:37:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2020-07-07 11:37:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1343 transitions. [2020-07-07 11:37:17,965 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1343 transitions. Word has length 132 [2020-07-07 11:37:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:17,966 INFO L479 AbstractCegarLoop]: Abstraction has 1007 states and 1343 transitions. [2020-07-07 11:37:17,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1343 transitions. [2020-07-07 11:37:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-07-07 11:37:17,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:17,969 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, 1] [2020-07-07 11:37:17,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 11:37:17,970 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -995469210, now seen corresponding path program 1 times [2020-07-07 11:37:17,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:17,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333022618] [2020-07-07 11:37:17,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,178 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:18,436 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-07 11:37:18,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333022618] [2020-07-07 11:37:18,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:18,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:18,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268835050] [2020-07-07 11:37:18,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:18,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:18,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:18,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:18,439 INFO L87 Difference]: Start difference. First operand 1007 states and 1343 transitions. Second operand 13 states. [2020-07-07 11:37:18,589 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:19,908 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:22,170 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-07 11:37:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:24,344 INFO L93 Difference]: Finished difference Result 1853 states and 2489 transitions. [2020-07-07 11:37:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 11:37:24,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2020-07-07 11:37:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:24,353 INFO L225 Difference]: With dead ends: 1853 [2020-07-07 11:37:24,353 INFO L226 Difference]: Without dead ends: 1018 [2020-07-07 11:37:24,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2020-07-07 11:37:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-07-07 11:37:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1012. [2020-07-07 11:37:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-07-07 11:37:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1346 transitions. [2020-07-07 11:37:24,514 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1346 transitions. Word has length 138 [2020-07-07 11:37:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:24,515 INFO L479 AbstractCegarLoop]: Abstraction has 1012 states and 1346 transitions. [2020-07-07 11:37:24,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1346 transitions. [2020-07-07 11:37:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-07 11:37:24,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:24,519 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-07 11:37:24,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 11:37:24,520 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash -706669336, now seen corresponding path program 1 times [2020-07-07 11:37:24,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:24,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439337634] [2020-07-07 11:37:24,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:24,909 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:25,526 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-07 11:37:25,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439337634] [2020-07-07 11:37:25,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:25,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 11:37:25,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988604927] [2020-07-07 11:37:25,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 11:37:25,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 11:37:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:37:25,530 INFO L87 Difference]: Start difference. First operand 1012 states and 1346 transitions. Second operand 19 states. [2020-07-07 11:37:25,823 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-07 11:37:26,043 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:26,445 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-07 11:37:27,364 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:28,484 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-07-07 11:37:28,685 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-07 11:37:29,133 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:29,316 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:29,483 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:31,263 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:31,430 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:31,576 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:31,752 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:37:31,917 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:32,221 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:37:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:34,774 INFO L93 Difference]: Finished difference Result 2697 states and 3560 transitions. [2020-07-07 11:37:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-07 11:37:34,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 137 [2020-07-07 11:37:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:34,786 INFO L225 Difference]: With dead ends: 2697 [2020-07-07 11:37:34,786 INFO L226 Difference]: Without dead ends: 1850 [2020-07-07 11:37:34,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2020-07-07 11:37:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2020-07-07 11:37:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1746. [2020-07-07 11:37:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2020-07-07 11:37:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2276 transitions. [2020-07-07 11:37:34,986 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2276 transitions. Word has length 137 [2020-07-07 11:37:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:34,987 INFO L479 AbstractCegarLoop]: Abstraction has 1746 states and 2276 transitions. [2020-07-07 11:37:34,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 11:37:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2276 transitions. [2020-07-07 11:37:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-07-07 11:37:34,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:34,990 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-07 11:37:34,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 11:37:34,990 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1423528137, now seen corresponding path program 1 times [2020-07-07 11:37:34,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:34,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724987951] [2020-07-07 11:37:34,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,197 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:35,454 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-07 11:37:35,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724987951] [2020-07-07 11:37:35,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:35,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:37:35,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127376380] [2020-07-07 11:37:35,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:37:35,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:37:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:35,460 INFO L87 Difference]: Start difference. First operand 1746 states and 2276 transitions. Second operand 13 states. [2020-07-07 11:37:37,068 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:37,209 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:38,021 INFO L93 Difference]: Finished difference Result 3169 states and 4158 transitions. [2020-07-07 11:37:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:37:38,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-07-07 11:37:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:38,031 INFO L225 Difference]: With dead ends: 3169 [2020-07-07 11:37:38,032 INFO L226 Difference]: Without dead ends: 1762 [2020-07-07 11:37:38,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 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-07 11:37:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-07-07 11:37:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1750. [2020-07-07 11:37:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2020-07-07 11:37:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2254 transitions. [2020-07-07 11:37:38,273 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2254 transitions. Word has length 139 [2020-07-07 11:37:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:38,274 INFO L479 AbstractCegarLoop]: Abstraction has 1750 states and 2254 transitions. [2020-07-07 11:37:38,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:37:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2254 transitions. [2020-07-07 11:37:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-07 11:37:38,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:38,277 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-07 11:37:38,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 11:37:38,278 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:38,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash 399709620, now seen corresponding path program 1 times [2020-07-07 11:37:38,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:38,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288944801] [2020-07-07 11:37:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,551 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:38,914 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-07 11:37:38,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288944801] [2020-07-07 11:37:38,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:38,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 11:37:38,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867932179] [2020-07-07 11:37:38,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 11:37:38,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:38,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 11:37:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:37:38,917 INFO L87 Difference]: Start difference. First operand 1750 states and 2254 transitions. Second operand 19 states. [2020-07-07 11:37:39,293 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:41,958 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:37:42,155 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:42,366 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-07-07 11:37:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:43,122 INFO L93 Difference]: Finished difference Result 1856 states and 2405 transitions. [2020-07-07 11:37:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:37:43,123 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 140 [2020-07-07 11:37:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:43,131 INFO L225 Difference]: With dead ends: 1856 [2020-07-07 11:37:43,131 INFO L226 Difference]: Without dead ends: 1854 [2020-07-07 11:37:43,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2020-07-07 11:37:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2020-07-07 11:37:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1778. [2020-07-07 11:37:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2020-07-07 11:37:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2286 transitions. [2020-07-07 11:37:43,323 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2286 transitions. Word has length 140 [2020-07-07 11:37:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:43,324 INFO L479 AbstractCegarLoop]: Abstraction has 1778 states and 2286 transitions. [2020-07-07 11:37:43,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 11:37:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2286 transitions. [2020-07-07 11:37:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-07-07 11:37:43,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:43,327 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-07 11:37:43,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 11:37:43,327 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash -438075968, now seen corresponding path program 1 times [2020-07-07 11:37:43,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:43,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634595874] [2020-07-07 11:37:43,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,547 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:43,872 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-07 11:37:43,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634595874] [2020-07-07 11:37:43,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:43,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-07 11:37:43,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889106842] [2020-07-07 11:37:43,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 11:37:43,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 11:37:43,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-07-07 11:37:43,874 INFO L87 Difference]: Start difference. First operand 1778 states and 2286 transitions. Second operand 18 states. [2020-07-07 11:37:44,093 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:44,256 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:46,019 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:48,114 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:48,392 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:37:50,022 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:50,180 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-07 11:37:50,323 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-07 11:37:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:50,737 INFO L93 Difference]: Finished difference Result 3638 states and 4642 transitions. [2020-07-07 11:37:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-07 11:37:50,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2020-07-07 11:37:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:50,749 INFO L225 Difference]: With dead ends: 3638 [2020-07-07 11:37:50,749 INFO L226 Difference]: Without dead ends: 2267 [2020-07-07 11:37:50,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2020-07-07 11:37:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2020-07-07 11:37:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1938. [2020-07-07 11:37:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2020-07-07 11:37:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2458 transitions. [2020-07-07 11:37:50,956 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2458 transitions. Word has length 141 [2020-07-07 11:37:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:50,958 INFO L479 AbstractCegarLoop]: Abstraction has 1938 states and 2458 transitions. [2020-07-07 11:37:50,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 11:37:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2458 transitions. [2020-07-07 11:37:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-07-07 11:37:50,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:50,961 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-07 11:37:50,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-07 11:37:50,961 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash -752706868, now seen corresponding path program 1 times [2020-07-07 11:37:50,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:50,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524707407] [2020-07-07 11:37:50,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,166 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:37:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:51,539 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-07 11:37:51,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524707407] [2020-07-07 11:37:51,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:51,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 11:37:51,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24787295] [2020-07-07 11:37:51,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 11:37:51,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 11:37:51,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:37:51,542 INFO L87 Difference]: Start difference. First operand 1938 states and 2458 transitions. Second operand 19 states. [2020-07-07 11:37:51,758 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-07 11:37:51,944 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:53,479 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-07 11:37:54,524 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:56,230 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:56,565 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:56,732 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:37:56,924 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:37:57,080 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:37:57,295 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:38:00,198 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:38:01,147 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:38:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:38:01,429 INFO L93 Difference]: Finished difference Result 5017 states and 6342 transitions. [2020-07-07 11:38:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-07-07 11:38:01,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2020-07-07 11:38:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:38:01,447 INFO L225 Difference]: With dead ends: 5017 [2020-07-07 11:38:01,447 INFO L226 Difference]: Without dead ends: 3542 [2020-07-07 11:38:01,456 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-07 11:38:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2020-07-07 11:38:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 2398. [2020-07-07 11:38:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2020-07-07 11:38:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3035 transitions. [2020-07-07 11:38:01,724 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3035 transitions. Word has length 145 [2020-07-07 11:38:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:38:01,724 INFO L479 AbstractCegarLoop]: Abstraction has 2398 states and 3035 transitions. [2020-07-07 11:38:01,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 11:38:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3035 transitions. [2020-07-07 11:38:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-07-07 11:38:01,727 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:38:01,727 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-07 11:38:01,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-07 11:38:01,727 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:38:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:38:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1588390895, now seen corresponding path program 1 times [2020-07-07 11:38:01,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:38:01,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648358128] [2020-07-07 11:38:01,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:38:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:01,927 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:38:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:02,373 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-07 11:38:02,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648358128] [2020-07-07 11:38:02,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:38:02,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 11:38:02,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461098549] [2020-07-07 11:38:02,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 11:38:02,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:38:02,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 11:38:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:38:02,376 INFO L87 Difference]: Start difference. First operand 2398 states and 3035 transitions. Second operand 19 states. [2020-07-07 11:38:02,530 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-07-07 11:38:03,764 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:38:06,055 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:38:06,202 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:38:06,396 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:38:06,744 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-07-07 11:38:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:38:10,260 INFO L93 Difference]: Finished difference Result 4736 states and 6090 transitions. [2020-07-07 11:38:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-07 11:38:10,261 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2020-07-07 11:38:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:38:10,273 INFO L225 Difference]: With dead ends: 4736 [2020-07-07 11:38:10,274 INFO L226 Difference]: Without dead ends: 2677 [2020-07-07 11:38:10,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=383, Invalid=1177, Unknown=0, NotChecked=0, Total=1560 [2020-07-07 11:38:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2020-07-07 11:38:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2316. [2020-07-07 11:38:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2020-07-07 11:38:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 2915 transitions. [2020-07-07 11:38:10,487 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 2915 transitions. Word has length 146 [2020-07-07 11:38:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:38:10,487 INFO L479 AbstractCegarLoop]: Abstraction has 2316 states and 2915 transitions. [2020-07-07 11:38:10,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 11:38:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 2915 transitions. [2020-07-07 11:38:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-07-07 11:38:10,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:38:10,489 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-07 11:38:10,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-07 11:38:10,490 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:38:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:38:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1326355799, now seen corresponding path program 1 times [2020-07-07 11:38:10,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:38:10,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4885420] [2020-07-07 11:38:10,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:38:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,672 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:38:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:10,965 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-07 11:38:10,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4885420] [2020-07-07 11:38:10,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:38:10,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 11:38:10,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670032019] [2020-07-07 11:38:10,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:38:10,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:38:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:38:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:38:10,967 INFO L87 Difference]: Start difference. First operand 2316 states and 2915 transitions. Second operand 14 states. [2020-07-07 11:38:11,129 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-07 11:38:12,119 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-07 11:38:12,990 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 11:38:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:38:17,766 INFO L93 Difference]: Finished difference Result 6534 states and 8335 transitions. [2020-07-07 11:38:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-07 11:38:17,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 146 [2020-07-07 11:38:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:38:17,787 INFO L225 Difference]: With dead ends: 6534 [2020-07-07 11:38:17,788 INFO L226 Difference]: Without dead ends: 4581 [2020-07-07 11:38:17,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-07-07 11:38:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2020-07-07 11:38:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4055. [2020-07-07 11:38:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4055 states. [2020-07-07 11:38:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5139 transitions. [2020-07-07 11:38:18,390 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5139 transitions. Word has length 146 [2020-07-07 11:38:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:38:18,391 INFO L479 AbstractCegarLoop]: Abstraction has 4055 states and 5139 transitions. [2020-07-07 11:38:18,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:38:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5139 transitions. [2020-07-07 11:38:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-07 11:38:18,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:38:18,396 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-07 11:38:18,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-07 11:38:18,396 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:38:18,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:38:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1263317101, now seen corresponding path program 1 times [2020-07-07 11:38:18,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:38:18,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747713453] [2020-07-07 11:38:18,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:38:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,664 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:38:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:19,070 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-07 11:38:19,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747713453] [2020-07-07 11:38:19,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:38:19,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-07 11:38:19,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503260230] [2020-07-07 11:38:19,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 11:38:19,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:38:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 11:38:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-07-07 11:38:19,072 INFO L87 Difference]: Start difference. First operand 4055 states and 5139 transitions. Second operand 18 states. [2020-07-07 11:38:19,458 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-07-07 11:38:19,645 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-07 11:38:21,551 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-07-07 11:38:21,882 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-07-07 11:38:22,163 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-07-07 11:38:23,771 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-07 11:38:23,958 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-07 11:38:24,170 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-07 11:38:24,375 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-07 11:38:24,578 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-07 11:38:24,780 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-07 11:38:25,114 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-07 11:38:25,568 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-07-07 11:38:25,909 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2020-07-07 11:38:26,077 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-07-07 11:38:30,645 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-07 11:38:31,133 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-07 11:38:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:38:33,016 INFO L93 Difference]: Finished difference Result 9482 states and 12120 transitions. [2020-07-07 11:38:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-07 11:38:33,018 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-07-07 11:38:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:38:33,046 INFO L225 Difference]: With dead ends: 9482 [2020-07-07 11:38:33,046 INFO L226 Difference]: Without dead ends: 5905 [2020-07-07 11:38:33,057 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-07 11:38:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5905 states. [2020-07-07 11:38:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5905 to 4607. [2020-07-07 11:38:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2020-07-07 11:38:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 5813 transitions. [2020-07-07 11:38:33,485 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 5813 transitions. Word has length 148 [2020-07-07 11:38:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:38:33,485 INFO L479 AbstractCegarLoop]: Abstraction has 4607 states and 5813 transitions. [2020-07-07 11:38:33,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 11:38:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 5813 transitions. [2020-07-07 11:38:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-07 11:38:33,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:38:33,488 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-07 11:38:33,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-07 11:38:33,488 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:38:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:38:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1023637049, now seen corresponding path program 1 times [2020-07-07 11:38:33,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:38:33,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268254401] [2020-07-07 11:38:33,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:38:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:33,766 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:38:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:34,476 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-07 11:38:34,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268254401] [2020-07-07 11:38:34,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:38:34,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-07 11:38:34,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289818535] [2020-07-07 11:38:34,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 11:38:34,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:38:34,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 11:38:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:38:34,480 INFO L87 Difference]: Start difference. First operand 4607 states and 5813 transitions. Second operand 17 states. [2020-07-07 11:38:34,653 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:38:35,031 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-07-07 11:38:35,407 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2020-07-07 11:38:35,873 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2020-07-07 11:38:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:38:39,162 INFO L93 Difference]: Finished difference Result 9197 states and 11611 transitions. [2020-07-07 11:38:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 11:38:39,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2020-07-07 11:38:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:38:39,184 INFO L225 Difference]: With dead ends: 9197 [2020-07-07 11:38:39,185 INFO L226 Difference]: Without dead ends: 4619 [2020-07-07 11:38:39,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 11:38:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-07-07 11:38:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4615. [2020-07-07 11:38:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2020-07-07 11:38:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 5821 transitions. [2020-07-07 11:38:39,781 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 5821 transitions. Word has length 149 [2020-07-07 11:38:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:38:39,782 INFO L479 AbstractCegarLoop]: Abstraction has 4615 states and 5821 transitions. [2020-07-07 11:38:39,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 11:38:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 5821 transitions. [2020-07-07 11:38:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-07 11:38:39,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:38:39,785 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-07 11:38:39,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-07 11:38:39,785 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:38:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:38:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash 552280699, now seen corresponding path program 1 times [2020-07-07 11:38:39,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:38:39,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606691678] [2020-07-07 11:38:39,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:38:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,128 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-07 11:38:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:38:40,602 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-07 11:38:40,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606691678] [2020-07-07 11:38:40,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:38:40,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 11:38:40,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709071428] [2020-07-07 11:38:40,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 11:38:40,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:38:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 11:38:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:38:40,604 INFO L87 Difference]: Start difference. First operand 4615 states and 5821 transitions. Second operand 20 states. [2020-07-07 11:38:40,776 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-07 11:38:41,422 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 142 [2020-07-07 11:38:41,779 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2020-07-07 11:38:42,016 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2020-07-07 11:38:42,446 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2020-07-07 11:38:42,684 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2020-07-07 11:38:43,001 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-07 11:38:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:38:48,900 INFO L93 Difference]: Finished difference Result 9018 states and 11393 transitions. [2020-07-07 11:38:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 11:38:48,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 149 [2020-07-07 11:38:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:38:48,921 INFO L225 Difference]: With dead ends: 9018 [2020-07-07 11:38:48,922 INFO L226 Difference]: Without dead ends: 4664 [2020-07-07 11:38:48,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=568, Invalid=2188, Unknown=0, NotChecked=0, Total=2756 [2020-07-07 11:38:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2020-07-07 11:38:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 4615. [2020-07-07 11:38:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2020-07-07 11:38:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 5803 transitions. [2020-07-07 11:38:49,505 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 5803 transitions. Word has length 149 [2020-07-07 11:38:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:38:49,505 INFO L479 AbstractCegarLoop]: Abstraction has 4615 states and 5803 transitions. [2020-07-07 11:38:49,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 11:38:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 5803 transitions. [2020-07-07 11:38:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-07 11:38:49,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:38:49,509 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-07 11:38:49,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-07 11:38:49,509 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:38:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:38:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1998716393, now seen corresponding path program 1 times [2020-07-07 11:38:49,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:38:49,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848908927] [2020-07-07 11:38:49,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:38:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:38:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:38:49,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:38:49,748 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:38:49,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-07 11:38:50,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:38:50 BoogieIcfgContainer [2020-07-07 11:38:50,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:38:50,058 INFO L168 Benchmark]: Toolchain (without parser) took 140572.28 ms. Allocated memory was 135.8 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 99.3 MB in the beginning and 105.2 MB in the end (delta: -5.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-07-07 11:38:50,058 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 135.8 MB. Free memory is still 118.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-07 11:38:50,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.88 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 171.3 MB in the end (delta: -72.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:38:50,059 INFO L168 Benchmark]: Boogie Preprocessor took 72.62 ms. Allocated memory is still 199.8 MB. Free memory was 171.3 MB in the beginning and 168.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:38:50,059 INFO L168 Benchmark]: RCFGBuilder took 937.49 ms. Allocated memory is still 199.8 MB. Free memory was 167.1 MB in the beginning and 104.2 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:38:50,061 INFO L168 Benchmark]: TraceAbstraction took 138936.94 ms. Allocated memory was 199.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 104.2 MB in the beginning and 105.2 MB in the end (delta: -1.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2020-07-07 11:38:50,063 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.19 ms. Allocated memory is still 135.8 MB. Free memory is still 118.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 619.88 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 171.3 MB in the end (delta: -72.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.62 ms. Allocated memory is still 199.8 MB. Free memory was 171.3 MB in the beginning and 168.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 937.49 ms. Allocated memory is still 199.8 MB. Free memory was 167.1 MB in the beginning and 104.2 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138936.94 ms. Allocated memory was 199.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 104.2 MB in the beginning and 105.2 MB in the end (delta: -1.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 665]: 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 i2 < 10 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] [L663] 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] [L665] __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, 243 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 138.5s, OverallIterations: 25, TraceHistogramMax: 2, AutomataDifference: 119.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7231 SDtfs, 31292 SDslu, 4136 SDs, 0 SdLazy, 43219 SolverSat, 11244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1486 GetRequests, 746 SyntacticMatches, 20 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4897 ImplicationChecksByTransitivity, 48.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4615occurred 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: 4.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 3966 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 3089 NumberOfCodeBlocks, 3089 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2915 ConstructedInterpolants, 0 QuantifiedInterpolants, 1439150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 179/179 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...