/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:56:33,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:56:33,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:56:33,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:56:33,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:56:33,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:56:33,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:56:33,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:56:33,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:56:33,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:56:33,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:56:33,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:56:33,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:56:33,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:56:33,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:56:33,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:56:33,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:56:33,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:56:33,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:56:33,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:56:33,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:56:33,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:56:33,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:56:33,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:56:33,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:56:33,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:56:33,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:56:33,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:56:33,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:56:33,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:56:33,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:56:33,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:56:33,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:56:33,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:56:33,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:56:33,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:56:33,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:56:33,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:56:33,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:56:33,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:56:33,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:56:33,236 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-11-06 22:56:33,285 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:56:33,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:56:33,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:56:33,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:56:33,290 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:56:33,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:56:33,290 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:56:33,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:56:33,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:56:33,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:56:33,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:56:33,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:56:33,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:56:33,292 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:56:33,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:56:33,293 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:56:33,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:56:33,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:56:33,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:56:33,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:56:33,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:56:33,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:56:33,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:56:33,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:56:33,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:56:33,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:56:33,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:56:33,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:56:33,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:56:33,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:56:33,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:56:33,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:56:33,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:56:33,774 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:56:33,775 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:56:33,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-11-06 22:56:33,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364b20c2f/1ec3996d65ae47ec861a1971b0673e75/FLAG53c0e6643 [2020-11-06 22:56:34,479 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:56:34,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-11-06 22:56:34,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364b20c2f/1ec3996d65ae47ec861a1971b0673e75/FLAG53c0e6643 [2020-11-06 22:56:34,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364b20c2f/1ec3996d65ae47ec861a1971b0673e75 [2020-11-06 22:56:34,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:56:34,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:56:34,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:56:34,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:56:34,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:56:34,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:34" (1/1) ... [2020-11-06 22:56:34,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373bda13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:34, skipping insertion in model container [2020-11-06 22:56:34,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:34" (1/1) ... [2020-11-06 22:56:34,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:56:34,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:56:35,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:56:35,198 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:56:35,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:56:35,302 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:56:35,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35 WrapperNode [2020-11-06 22:56:35,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:56:35,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:56:35,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:56:35,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:56:35,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (1/1) ... [2020-11-06 22:56:35,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:56:35,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:56:35,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:56:35,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:56:35,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (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-11-06 22:56:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:56:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:56:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:56:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:56:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-11-06 22:56:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-11-06 22:56:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-11-06 22:56:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-11-06 22:56:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-11-06 22:56:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-11-06 22:56:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-11-06 22:56:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-11-06 22:56:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-11-06 22:56:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:56:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-11-06 22:56:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:56:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-11-06 22:56:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-11-06 22:56:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-11-06 22:56:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:56:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:56:35,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:56:35,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:56:36,578 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:56:36,579 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:56:36,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:36 BoogieIcfgContainer [2020-11-06 22:56:36,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:56:36,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:56:36,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:56:36,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:56:36,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:56:34" (1/3) ... [2020-11-06 22:56:36,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4051277d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:36, skipping insertion in model container [2020-11-06 22:56:36,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:35" (2/3) ... [2020-11-06 22:56:36,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4051277d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:36, skipping insertion in model container [2020-11-06 22:56:36,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:36" (3/3) ... [2020-11-06 22:56:36,590 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-11-06 22:56:36,606 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:56:36,610 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:56:36,622 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:56:36,651 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:56:36,651 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:56:36,651 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:56:36,651 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:56:36,652 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:56:36,652 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:56:36,652 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:56:36,652 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:56:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2020-11-06 22:56:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-06 22:56:36,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:36,689 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] [2020-11-06 22:56:36,689 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 468525090, now seen corresponding path program 1 times [2020-11-06 22:56:36,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:36,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849670570] [2020-11-06 22:56:36,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,378 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:37,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:56:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:56:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-06 22:56:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:56:37,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849670570] [2020-11-06 22:56:37,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:37,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-06 22:56:37,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500784464] [2020-11-06 22:56:37,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:56:37,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:37,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:56:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:56:37,781 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 14 states. [2020-11-06 22:56:38,112 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:38,417 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:38,660 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:42,050 INFO L93 Difference]: Finished difference Result 465 states and 717 transitions. [2020-11-06 22:56:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:56:42,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2020-11-06 22:56:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:42,066 INFO L225 Difference]: With dead ends: 465 [2020-11-06 22:56:42,067 INFO L226 Difference]: Without dead ends: 238 [2020-11-06 22:56:42,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:56:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-11-06 22:56:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-11-06 22:56:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-11-06 22:56:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 331 transitions. [2020-11-06 22:56:42,179 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 331 transitions. Word has length 72 [2020-11-06 22:56:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:42,179 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 331 transitions. [2020-11-06 22:56:42,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:56:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 331 transitions. [2020-11-06 22:56:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-06 22:56:42,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:42,184 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, 1] [2020-11-06 22:56:42,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:56:42,185 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -439316483, now seen corresponding path program 1 times [2020-11-06 22:56:42,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:42,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664599168] [2020-11-06 22:56:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,595 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:42,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:56:42,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664599168] [2020-11-06 22:56:42,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:42,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:56:42,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298544017] [2020-11-06 22:56:42,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:56:42,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:42,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:56:42,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:56:42,834 INFO L87 Difference]: Start difference. First operand 238 states and 331 transitions. Second operand 11 states. [2020-11-06 22:56:44,123 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:44,401 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:45,795 INFO L93 Difference]: Finished difference Result 456 states and 647 transitions. [2020-11-06 22:56:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:56:45,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-11-06 22:56:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:45,803 INFO L225 Difference]: With dead ends: 456 [2020-11-06 22:56:45,804 INFO L226 Difference]: Without dead ends: 242 [2020-11-06 22:56:45,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:56:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-06 22:56:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-11-06 22:56:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-06 22:56:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2020-11-06 22:56:45,861 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 83 [2020-11-06 22:56:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:45,861 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2020-11-06 22:56:45,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:56:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2020-11-06 22:56:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-06 22:56:45,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:45,864 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-11-06 22:56:45,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:56:45,865 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash 975321957, now seen corresponding path program 1 times [2020-11-06 22:56:45,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:45,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701551120] [2020-11-06 22:56:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,232 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:46,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:56:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:56:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:46,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701551120] [2020-11-06 22:56:46,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:46,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:56:46,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087097838] [2020-11-06 22:56:46,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:56:46,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:46,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:56:46,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:56:46,627 INFO L87 Difference]: Start difference. First operand 242 states and 334 transitions. Second operand 16 states. [2020-11-06 22:56:46,914 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:48,336 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:56:48,480 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:56:48,634 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:56:48,807 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:56:48,979 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:56:49,264 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:51,722 INFO L93 Difference]: Finished difference Result 551 states and 760 transitions. [2020-11-06 22:56:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:56:51,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-06 22:56:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:51,728 INFO L225 Difference]: With dead ends: 551 [2020-11-06 22:56:51,729 INFO L226 Difference]: Without dead ends: 333 [2020-11-06 22:56:51,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:56:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-11-06 22:56:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-11-06 22:56:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-11-06 22:56:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-11-06 22:56:51,812 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 105 [2020-11-06 22:56:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:51,814 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-11-06 22:56:51,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:56:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-11-06 22:56:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-06 22:56:51,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:51,825 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] [2020-11-06 22:56:51,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:56:51,827 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1861944235, now seen corresponding path program 1 times [2020-11-06 22:56:51,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:51,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133679707] [2020-11-06 22:56:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,142 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:52,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:56:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-06 22:56:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:52,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133679707] [2020-11-06 22:56:52,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:52,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:56:52,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352423794] [2020-11-06 22:56:52,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:56:52,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:56:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:56:52,540 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 16 states. [2020-11-06 22:56:52,822 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:54,396 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:56:54,538 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:56:55,238 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:57,625 INFO L93 Difference]: Finished difference Result 557 states and 768 transitions. [2020-11-06 22:56:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:56:57,626 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2020-11-06 22:56:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:57,630 INFO L225 Difference]: With dead ends: 557 [2020-11-06 22:56:57,630 INFO L226 Difference]: Without dead ends: 336 [2020-11-06 22:56:57,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:56:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-11-06 22:56:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2020-11-06 22:56:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-11-06 22:56:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-11-06 22:56:57,702 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 106 [2020-11-06 22:56:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:57,705 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-11-06 22:56:57,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:56:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-11-06 22:56:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-06 22:56:57,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:57,708 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-11-06 22:56:57,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:56:57,709 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash -239018458, now seen corresponding path program 1 times [2020-11-06 22:56:57,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:57,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406347900] [2020-11-06 22:56:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,015 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:58,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:56:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:58,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406347900] [2020-11-06 22:56:58,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:58,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:56:58,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969757157] [2020-11-06 22:56:58,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:56:58,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:56:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:56:58,433 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 16 states. [2020-11-06 22:56:58,702 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:59,148 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:00,507 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:57:00,781 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:57:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:03,417 INFO L93 Difference]: Finished difference Result 558 states and 772 transitions. [2020-11-06 22:57:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:57:03,422 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-11-06 22:57:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:03,426 INFO L225 Difference]: With dead ends: 558 [2020-11-06 22:57:03,426 INFO L226 Difference]: Without dead ends: 337 [2020-11-06 22:57:03,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:57:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-11-06 22:57:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2020-11-06 22:57:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-06 22:57:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 450 transitions. [2020-11-06 22:57:03,487 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 450 transitions. Word has length 108 [2020-11-06 22:57:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:03,488 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 450 transitions. [2020-11-06 22:57:03,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:57:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 450 transitions. [2020-11-06 22:57:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-06 22:57:03,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:03,490 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-11-06 22:57:03,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:57:03,490 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash -608704195, now seen corresponding path program 1 times [2020-11-06 22:57:03,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:03,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055005688] [2020-11-06 22:57:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,779 WARN L194 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:03,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:03,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:04,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:04,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:04,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:04,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:57:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:04,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055005688] [2020-11-06 22:57:04,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:04,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:57:04,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392590347] [2020-11-06 22:57:04,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:57:04,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:57:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:57:04,084 INFO L87 Difference]: Start difference. First operand 333 states and 450 transitions. Second operand 12 states. [2020-11-06 22:57:05,088 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:05,950 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-06 22:57:07,483 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-06 22:57:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:08,673 INFO L93 Difference]: Finished difference Result 794 states and 1099 transitions. [2020-11-06 22:57:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:57:08,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-11-06 22:57:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:08,679 INFO L225 Difference]: With dead ends: 794 [2020-11-06 22:57:08,679 INFO L226 Difference]: Without dead ends: 572 [2020-11-06 22:57:08,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:57:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-11-06 22:57:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 554. [2020-11-06 22:57:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-11-06 22:57:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 762 transitions. [2020-11-06 22:57:08,771 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 762 transitions. Word has length 108 [2020-11-06 22:57:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:08,771 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 762 transitions. [2020-11-06 22:57:08,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:57:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 762 transitions. [2020-11-06 22:57:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-06 22:57:08,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:08,773 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] [2020-11-06 22:57:08,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:57:08,774 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1264432004, now seen corresponding path program 1 times [2020-11-06 22:57:08,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:08,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242474414] [2020-11-06 22:57:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,071 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:09,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:57:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:57:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-06 22:57:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:09,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242474414] [2020-11-06 22:57:09,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:09,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:57:09,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182073206] [2020-11-06 22:57:09,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:57:09,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:09,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:57:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:57:09,353 INFO L87 Difference]: Start difference. First operand 554 states and 762 transitions. Second operand 12 states. [2020-11-06 22:57:09,729 WARN L194 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:11,527 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:57:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:14,136 INFO L93 Difference]: Finished difference Result 972 states and 1354 transitions. [2020-11-06 22:57:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:57:14,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2020-11-06 22:57:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:14,149 INFO L225 Difference]: With dead ends: 972 [2020-11-06 22:57:14,149 INFO L226 Difference]: Without dead ends: 572 [2020-11-06 22:57:14,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:57:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-11-06 22:57:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 554. [2020-11-06 22:57:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-11-06 22:57:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 760 transitions. [2020-11-06 22:57:14,232 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 760 transitions. Word has length 110 [2020-11-06 22:57:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:14,233 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 760 transitions. [2020-11-06 22:57:14,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:57:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 760 transitions. [2020-11-06 22:57:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-06 22:57:14,235 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:14,235 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-11-06 22:57:14,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:57:14,235 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1758148230, now seen corresponding path program 1 times [2020-11-06 22:57:14,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:14,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728798237] [2020-11-06 22:57:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,509 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:14,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:14,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728798237] [2020-11-06 22:57:14,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:14,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:57:14,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13912955] [2020-11-06 22:57:14,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:57:14,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:57:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:57:14,806 INFO L87 Difference]: Start difference. First operand 554 states and 760 transitions. Second operand 12 states. [2020-11-06 22:57:16,106 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:16,318 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-06 22:57:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:19,284 INFO L93 Difference]: Finished difference Result 1317 states and 1847 transitions. [2020-11-06 22:57:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:57:19,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-11-06 22:57:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:19,292 INFO L225 Difference]: With dead ends: 1317 [2020-11-06 22:57:19,292 INFO L226 Difference]: Without dead ends: 917 [2020-11-06 22:57:19,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:57:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2020-11-06 22:57:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 910. [2020-11-06 22:57:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-11-06 22:57:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1266 transitions. [2020-11-06 22:57:19,437 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1266 transitions. Word has length 109 [2020-11-06 22:57:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:19,437 INFO L481 AbstractCegarLoop]: Abstraction has 910 states and 1266 transitions. [2020-11-06 22:57:19,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:57:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1266 transitions. [2020-11-06 22:57:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-06 22:57:19,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:19,440 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] [2020-11-06 22:57:19,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:57:19,440 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash -503701940, now seen corresponding path program 1 times [2020-11-06 22:57:19,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:19,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808663364] [2020-11-06 22:57:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,772 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:19,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:19,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:20,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:57:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:20,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:20,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:20,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-06 22:57:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:20,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808663364] [2020-11-06 22:57:20,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:20,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:57:20,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442105072] [2020-11-06 22:57:20,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:57:20,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:20,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:57:20,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:57:20,073 INFO L87 Difference]: Start difference. First operand 910 states and 1266 transitions. Second operand 12 states. [2020-11-06 22:57:20,342 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:21,754 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:57:22,046 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:57:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:24,570 INFO L93 Difference]: Finished difference Result 1660 states and 2336 transitions. [2020-11-06 22:57:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:57:24,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2020-11-06 22:57:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:24,579 INFO L225 Difference]: With dead ends: 1660 [2020-11-06 22:57:24,579 INFO L226 Difference]: Without dead ends: 922 [2020-11-06 22:57:24,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:57:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2020-11-06 22:57:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 915. [2020-11-06 22:57:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-11-06 22:57:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1269 transitions. [2020-11-06 22:57:24,740 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1269 transitions. Word has length 110 [2020-11-06 22:57:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:24,741 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1269 transitions. [2020-11-06 22:57:24,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:57:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1269 transitions. [2020-11-06 22:57:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-06 22:57:24,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:24,743 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-11-06 22:57:24,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:57:24,744 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1515750712, now seen corresponding path program 1 times [2020-11-06 22:57:24,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:24,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564513684] [2020-11-06 22:57:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,065 WARN L194 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:25,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:25,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564513684] [2020-11-06 22:57:25,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:25,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:25,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039282356] [2020-11-06 22:57:25,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:25,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:25,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:25,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:25,332 INFO L87 Difference]: Start difference. First operand 915 states and 1269 transitions. Second operand 13 states. [2020-11-06 22:57:27,090 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:27,332 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:28,597 INFO L93 Difference]: Finished difference Result 1673 states and 2354 transitions. [2020-11-06 22:57:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:57:28,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2020-11-06 22:57:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:28,606 INFO L225 Difference]: With dead ends: 1673 [2020-11-06 22:57:28,606 INFO L226 Difference]: Without dead ends: 935 [2020-11-06 22:57:28,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:57:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-11-06 22:57:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2020-11-06 22:57:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2020-11-06 22:57:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1285 transitions. [2020-11-06 22:57:28,751 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1285 transitions. Word has length 109 [2020-11-06 22:57:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:28,751 INFO L481 AbstractCegarLoop]: Abstraction has 935 states and 1285 transitions. [2020-11-06 22:57:28,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:57:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1285 transitions. [2020-11-06 22:57:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-06 22:57:28,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:28,754 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:57:28,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:57:28,755 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1129294434, now seen corresponding path program 1 times [2020-11-06 22:57:28,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:28,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483571310] [2020-11-06 22:57:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,050 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:29,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:29,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483571310] [2020-11-06 22:57:29,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:29,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:29,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104227173] [2020-11-06 22:57:29,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:29,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:29,341 INFO L87 Difference]: Start difference. First operand 935 states and 1285 transitions. Second operand 13 states. [2020-11-06 22:57:31,097 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:31,355 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:32,497 INFO L93 Difference]: Finished difference Result 1713 states and 2398 transitions. [2020-11-06 22:57:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:57:32,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2020-11-06 22:57:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:32,505 INFO L225 Difference]: With dead ends: 1713 [2020-11-06 22:57:32,505 INFO L226 Difference]: Without dead ends: 955 [2020-11-06 22:57:32,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:57:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2020-11-06 22:57:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2020-11-06 22:57:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2020-11-06 22:57:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1301 transitions. [2020-11-06 22:57:32,662 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1301 transitions. Word has length 117 [2020-11-06 22:57:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:32,663 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 1301 transitions. [2020-11-06 22:57:32,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:57:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1301 transitions. [2020-11-06 22:57:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-06 22:57:32,666 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:32,666 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, 1] [2020-11-06 22:57:32,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:57:32,666 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash -787284076, now seen corresponding path program 1 times [2020-11-06 22:57:32,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:32,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797453194] [2020-11-06 22:57:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:32,959 WARN L194 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:32,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:32,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:32,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:32,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:57:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:33,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797453194] [2020-11-06 22:57:33,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:33,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:33,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314891585] [2020-11-06 22:57:33,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:33,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:33,238 INFO L87 Difference]: Start difference. First operand 955 states and 1301 transitions. Second operand 13 states. [2020-11-06 22:57:35,236 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:35,481 WARN L194 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:36,575 INFO L93 Difference]: Finished difference Result 1749 states and 2414 transitions. [2020-11-06 22:57:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:57:36,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2020-11-06 22:57:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:36,584 INFO L225 Difference]: With dead ends: 1749 [2020-11-06 22:57:36,584 INFO L226 Difference]: Without dead ends: 971 [2020-11-06 22:57:36,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:57:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2020-11-06 22:57:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2020-11-06 22:57:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2020-11-06 22:57:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1313 transitions. [2020-11-06 22:57:36,722 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1313 transitions. Word has length 125 [2020-11-06 22:57:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:36,723 INFO L481 AbstractCegarLoop]: Abstraction has 971 states and 1313 transitions. [2020-11-06 22:57:36,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:57:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1313 transitions. [2020-11-06 22:57:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-06 22:57:36,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:36,726 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, 1] [2020-11-06 22:57:36,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:57:36,726 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1093373196, now seen corresponding path program 1 times [2020-11-06 22:57:36,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:36,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823767966] [2020-11-06 22:57:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,034 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:37,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:57:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:57:37,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823767966] [2020-11-06 22:57:37,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:37,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:37,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183570401] [2020-11-06 22:57:37,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:37,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:37,355 INFO L87 Difference]: Start difference. First operand 971 states and 1313 transitions. Second operand 13 states. [2020-11-06 22:57:39,266 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:39,516 WARN L194 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:40,716 INFO L93 Difference]: Finished difference Result 1785 states and 2454 transitions. [2020-11-06 22:57:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:57:40,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2020-11-06 22:57:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:40,725 INFO L225 Difference]: With dead ends: 1785 [2020-11-06 22:57:40,726 INFO L226 Difference]: Without dead ends: 991 [2020-11-06 22:57:40,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:57:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2020-11-06 22:57:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2020-11-06 22:57:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-11-06 22:57:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1329 transitions. [2020-11-06 22:57:40,877 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1329 transitions. Word has length 125 [2020-11-06 22:57:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:40,880 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1329 transitions. [2020-11-06 22:57:40,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:57:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1329 transitions. [2020-11-06 22:57:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-06 22:57:40,883 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:40,883 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, 1] [2020-11-06 22:57:40,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:57:40,884 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1684639180, now seen corresponding path program 1 times [2020-11-06 22:57:40,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:40,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921234959] [2020-11-06 22:57:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,210 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:41,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:57:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-06 22:57:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-06 22:57:41,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921234959] [2020-11-06 22:57:41,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:41,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:41,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991983361] [2020-11-06 22:57:41,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:41,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:41,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:41,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:41,518 INFO L87 Difference]: Start difference. First operand 991 states and 1329 transitions. Second operand 13 states. [2020-11-06 22:57:43,817 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:44,066 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:44,763 INFO L93 Difference]: Finished difference Result 1829 states and 2482 transitions. [2020-11-06 22:57:44,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:57:44,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 133 [2020-11-06 22:57:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:44,770 INFO L225 Difference]: With dead ends: 1829 [2020-11-06 22:57:44,770 INFO L226 Difference]: Without dead ends: 1015 [2020-11-06 22:57:44,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:57:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2020-11-06 22:57:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2020-11-06 22:57:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2020-11-06 22:57:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1349 transitions. [2020-11-06 22:57:44,912 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1349 transitions. Word has length 133 [2020-11-06 22:57:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:44,912 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1349 transitions. [2020-11-06 22:57:44,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:57:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1349 transitions. [2020-11-06 22:57:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-06 22:57:44,916 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:44,916 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-11-06 22:57:44,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:57:44,916 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:44,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1814018200, now seen corresponding path program 1 times [2020-11-06 22:57:44,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:44,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951316400] [2020-11-06 22:57:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,333 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:45,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:57:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:57:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:57:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:57:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:57:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:57:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-06 22:57:45,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951316400] [2020-11-06 22:57:45,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:45,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:57:45,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239705821] [2020-11-06 22:57:45,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:57:45,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:57:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:57:45,782 INFO L87 Difference]: Start difference. First operand 1015 states and 1349 transitions. Second operand 19 states. [2020-11-06 22:57:46,120 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:57:46,398 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:46,738 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:57:47,614 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:49,236 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:49,526 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:49,821 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:51,464 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:57:52,064 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:52,348 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:52,599 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:52,880 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:53,154 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:53,625 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:56,752 INFO L93 Difference]: Finished difference Result 2705 states and 3568 transitions. [2020-11-06 22:57:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-06 22:57:56,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 138 [2020-11-06 22:57:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:56,763 INFO L225 Difference]: With dead ends: 2705 [2020-11-06 22:57:56,763 INFO L226 Difference]: Without dead ends: 1847 [2020-11-06 22:57:56,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2020-11-06 22:57:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2020-11-06 22:57:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1745. [2020-11-06 22:57:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2020-11-06 22:57:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2267 transitions. [2020-11-06 22:57:57,008 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2267 transitions. Word has length 138 [2020-11-06 22:57:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:57,008 INFO L481 AbstractCegarLoop]: Abstraction has 1745 states and 2267 transitions. [2020-11-06 22:57:57,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:57:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2267 transitions. [2020-11-06 22:57:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-06 22:57:57,011 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:57,011 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] [2020-11-06 22:57:57,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:57:57,012 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1193625722, now seen corresponding path program 1 times [2020-11-06 22:57:57,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:57,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889916973] [2020-11-06 22:57:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,297 WARN L194 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:57,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:57:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-06 22:57:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-06 22:57:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-06 22:57:57,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889916973] [2020-11-06 22:57:57,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:57,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:57,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041412448] [2020-11-06 22:57:57,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:57,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:57,580 INFO L87 Difference]: Start difference. First operand 1745 states and 2267 transitions. Second operand 13 states. [2020-11-06 22:57:59,549 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:59,794 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:58:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:00,822 INFO L93 Difference]: Finished difference Result 3171 states and 4152 transitions. [2020-11-06 22:58:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:58:00,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2020-11-06 22:58:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:00,837 INFO L225 Difference]: With dead ends: 3171 [2020-11-06 22:58:00,837 INFO L226 Difference]: Without dead ends: 1761 [2020-11-06 22:58:00,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:58:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2020-11-06 22:58:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1749. [2020-11-06 22:58:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2020-11-06 22:58:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2245 transitions. [2020-11-06 22:58:01,103 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2245 transitions. Word has length 140 [2020-11-06 22:58:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:01,104 INFO L481 AbstractCegarLoop]: Abstraction has 1749 states and 2245 transitions. [2020-11-06 22:58:01,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:58:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2245 transitions. [2020-11-06 22:58:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-06 22:58:01,107 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:01,107 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, 1] [2020-11-06 22:58:01,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:58:01,107 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash -557472038, now seen corresponding path program 1 times [2020-11-06 22:58:01,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:01,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821700219] [2020-11-06 22:58:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,453 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:01,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:58:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:58:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:58:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:58:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:58:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:58:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:58:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:58:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-06 22:58:01,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821700219] [2020-11-06 22:58:01,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:01,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:58:01,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043587489] [2020-11-06 22:58:01,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:58:01,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:58:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:58:01,872 INFO L87 Difference]: Start difference. First operand 1749 states and 2245 transitions. Second operand 19 states. [2020-11-06 22:58:02,277 WARN L194 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:05,597 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:58:05,913 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:06,232 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:58:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:07,161 INFO L93 Difference]: Finished difference Result 1854 states and 2395 transitions. [2020-11-06 22:58:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:58:07,166 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 141 [2020-11-06 22:58:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:07,176 INFO L225 Difference]: With dead ends: 1854 [2020-11-06 22:58:07,176 INFO L226 Difference]: Without dead ends: 1851 [2020-11-06 22:58:07,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2020-11-06 22:58:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2020-11-06 22:58:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1777. [2020-11-06 22:58:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1777 states. [2020-11-06 22:58:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2277 transitions. [2020-11-06 22:58:07,413 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2277 transitions. Word has length 141 [2020-11-06 22:58:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:07,413 INFO L481 AbstractCegarLoop]: Abstraction has 1777 states and 2277 transitions. [2020-11-06 22:58:07,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:58:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2277 transitions. [2020-11-06 22:58:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-06 22:58:07,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:07,416 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, 1] [2020-11-06 22:58:07,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:58:07,416 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1199422191, now seen corresponding path program 1 times [2020-11-06 22:58:07,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:07,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716582751] [2020-11-06 22:58:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,710 WARN L194 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:07,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:58:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:07,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:58:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:58:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:58:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:58:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-06 22:58:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-06 22:58:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-06 22:58:08,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716582751] [2020-11-06 22:58:08,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:08,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:58:08,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46006263] [2020-11-06 22:58:08,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:58:08,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:08,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:58:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:58:08,177 INFO L87 Difference]: Start difference. First operand 1777 states and 2277 transitions. Second operand 18 states. [2020-11-06 22:58:08,548 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:08,814 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:10,358 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-06 22:58:10,532 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:58:10,828 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:13,433 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:58:13,822 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:58:15,817 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:16,090 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:58:16,351 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:58:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:16,924 INFO L93 Difference]: Finished difference Result 3643 states and 4639 transitions. [2020-11-06 22:58:16,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:58:16,924 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2020-11-06 22:58:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:16,937 INFO L225 Difference]: With dead ends: 3643 [2020-11-06 22:58:16,937 INFO L226 Difference]: Without dead ends: 2269 [2020-11-06 22:58:16,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2020-11-06 22:58:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2020-11-06 22:58:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1937. [2020-11-06 22:58:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2020-11-06 22:58:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2449 transitions. [2020-11-06 22:58:17,219 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2449 transitions. Word has length 142 [2020-11-06 22:58:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:17,221 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 2449 transitions. [2020-11-06 22:58:17,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:58:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2449 transitions. [2020-11-06 22:58:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-11-06 22:58:17,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:17,224 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, 1] [2020-11-06 22:58:17,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:58:17,224 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1527474236, now seen corresponding path program 1 times [2020-11-06 22:58:17,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:17,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280968699] [2020-11-06 22:58:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,579 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:17,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:58:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:58:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:58:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:58:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:58:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:58:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:58:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:58:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:17,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:58:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-06 22:58:18,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280968699] [2020-11-06 22:58:18,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:18,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:58:18,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484094950] [2020-11-06 22:58:18,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:58:18,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:58:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:58:18,070 INFO L87 Difference]: Start difference. First operand 1937 states and 2449 transitions. Second operand 19 states. [2020-11-06 22:58:18,427 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:58:18,737 WARN L194 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:20,541 WARN L194 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:20,853 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:58:21,791 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:23,973 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:58:24,478 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:58:24,784 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:58:25,095 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:58:25,368 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:25,686 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:29,430 WARN L194 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:58:30,661 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:30,895 INFO L93 Difference]: Finished difference Result 5017 states and 6334 transitions. [2020-11-06 22:58:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-06 22:58:30,896 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2020-11-06 22:58:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:30,914 INFO L225 Difference]: With dead ends: 5017 [2020-11-06 22:58:30,914 INFO L226 Difference]: Without dead ends: 3539 [2020-11-06 22:58:30,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2020-11-06 22:58:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2020-11-06 22:58:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 2398. [2020-11-06 22:58:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2020-11-06 22:58:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3029 transitions. [2020-11-06 22:58:31,317 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3029 transitions. Word has length 146 [2020-11-06 22:58:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:31,317 INFO L481 AbstractCegarLoop]: Abstraction has 2398 states and 3029 transitions. [2020-11-06 22:58:31,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:58:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3029 transitions. [2020-11-06 22:58:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-06 22:58:31,319 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:31,319 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] [2020-11-06 22:58:31,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:58:31,320 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash 430823393, now seen corresponding path program 1 times [2020-11-06 22:58:31,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:31,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318493995] [2020-11-06 22:58:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,651 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:31,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:58:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:58:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:31,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:58:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:58:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:58:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:58:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:58:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-06 22:58:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:58:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-06 22:58:32,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318493995] [2020-11-06 22:58:32,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:32,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:58:32,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443832857] [2020-11-06 22:58:32,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:58:32,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:58:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:58:32,231 INFO L87 Difference]: Start difference. First operand 2398 states and 3029 transitions. Second operand 18 states. [2020-11-06 22:58:32,877 WARN L194 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 170 [2020-11-06 22:58:33,166 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:58:34,694 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2020-11-06 22:58:35,175 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2020-11-06 22:58:35,328 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:58:36,580 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-06 22:58:36,774 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-06 22:58:37,017 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-06 22:58:37,190 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:58:38,270 WARN L194 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-06 22:58:38,579 WARN L194 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-11-06 22:58:38,928 WARN L194 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-06 22:58:39,248 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-11-06 22:58:39,575 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-06 22:58:39,904 WARN L194 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-11-06 22:58:40,479 WARN L194 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 172 [2020-11-06 22:58:41,249 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-11-06 22:58:43,295 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-06 22:58:43,480 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:58:45,032 WARN L194 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:58:46,255 WARN L194 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 172 [2020-11-06 22:58:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:48,037 INFO L93 Difference]: Finished difference Result 6371 states and 8158 transitions. [2020-11-06 22:58:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-06 22:58:48,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2020-11-06 22:58:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:48,061 INFO L225 Difference]: With dead ends: 6371 [2020-11-06 22:58:48,062 INFO L226 Difference]: Without dead ends: 4309 [2020-11-06 22:58:48,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-11-06 22:58:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2020-11-06 22:58:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 2354. [2020-11-06 22:58:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2020-11-06 22:58:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 2950 transitions. [2020-11-06 22:58:48,527 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 2950 transitions. Word has length 147 [2020-11-06 22:58:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:48,527 INFO L481 AbstractCegarLoop]: Abstraction has 2354 states and 2950 transitions. [2020-11-06 22:58:48,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:58:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2950 transitions. [2020-11-06 22:58:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-06 22:58:48,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:48,529 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] [2020-11-06 22:58:48,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:58:48,529 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1528519068, now seen corresponding path program 1 times [2020-11-06 22:58:48,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:48,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731102808] [2020-11-06 22:58:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,813 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:48,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:48,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:58:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-06 22:58:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:58:49,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731102808] [2020-11-06 22:58:49,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:49,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-06 22:58:49,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697350621] [2020-11-06 22:58:49,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:58:49,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:58:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:58:49,260 INFO L87 Difference]: Start difference. First operand 2354 states and 2950 transitions. Second operand 14 states. [2020-11-06 22:58:49,540 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:58:50,896 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:58:52,028 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:58:53,714 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-06 22:58:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:57,830 INFO L93 Difference]: Finished difference Result 6624 states and 8423 transitions. [2020-11-06 22:58:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-06 22:58:57,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2020-11-06 22:58:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:57,852 INFO L225 Difference]: With dead ends: 6624 [2020-11-06 22:58:57,853 INFO L226 Difference]: Without dead ends: 4656 [2020-11-06 22:58:57,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-11-06 22:58:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2020-11-06 22:58:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4113. [2020-11-06 22:58:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2020-11-06 22:58:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5193 transitions. [2020-11-06 22:58:58,487 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5193 transitions. Word has length 147 [2020-11-06 22:58:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:58,488 INFO L481 AbstractCegarLoop]: Abstraction has 4113 states and 5193 transitions. [2020-11-06 22:58:58,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:58:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5193 transitions. [2020-11-06 22:58:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-06 22:58:58,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:58,490 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-11-06 22:58:58,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:58:58,491 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:58,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1014327538, now seen corresponding path program 1 times [2020-11-06 22:58:58,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:58,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207596513] [2020-11-06 22:58:58,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,832 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:58,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:58,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:58:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-06 22:58:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-06 22:58:59,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207596513] [2020-11-06 22:58:59,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:59,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:58:59,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886175758] [2020-11-06 22:58:59,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:58:59,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:58:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:58:59,298 INFO L87 Difference]: Start difference. First operand 4113 states and 5193 transitions. Second operand 18 states. [2020-11-06 22:58:59,644 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:58:59,942 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:59:02,298 WARN L194 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-11-06 22:59:02,631 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-06 22:59:02,816 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-06 22:59:03,060 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:59:04,685 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2020-11-06 22:59:04,978 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:59:05,287 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2020-11-06 22:59:05,589 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2020-11-06 22:59:05,887 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:59:06,209 WARN L194 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:59:09,097 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:59:11,250 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:59:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:59:13,411 INFO L93 Difference]: Finished difference Result 8279 states and 10618 transitions. [2020-11-06 22:59:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-06 22:59:13,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2020-11-06 22:59:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:59:13,435 INFO L225 Difference]: With dead ends: 8279 [2020-11-06 22:59:13,435 INFO L226 Difference]: Without dead ends: 4658 [2020-11-06 22:59:13,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2020-11-06 22:59:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2020-11-06 22:59:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 4043. [2020-11-06 22:59:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4043 states. [2020-11-06 22:59:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 5098 transitions. [2020-11-06 22:59:14,122 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 5098 transitions. Word has length 149 [2020-11-06 22:59:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:59:14,123 INFO L481 AbstractCegarLoop]: Abstraction has 4043 states and 5098 transitions. [2020-11-06 22:59:14,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:59:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 5098 transitions. [2020-11-06 22:59:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-06 22:59:14,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:59:14,125 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-11-06 22:59:14,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-06 22:59:14,126 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:59:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:59:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash 894667198, now seen corresponding path program 1 times [2020-11-06 22:59:14,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:59:14,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376794500] [2020-11-06 22:59:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:59:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,605 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:59:14,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:59:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:59:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:59:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:59:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:59:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:14,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:59:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:59:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:59:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-06 22:59:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:59:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:59:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:59:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:59:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:59:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:59:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:59:15,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376794500] [2020-11-06 22:59:15,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:59:15,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:59:15,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759763374] [2020-11-06 22:59:15,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:59:15,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:59:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:59:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:59:15,272 INFO L87 Difference]: Start difference. First operand 4043 states and 5098 transitions. Second operand 18 states. [2020-11-06 22:59:15,968 WARN L194 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 173 [2020-11-06 22:59:16,619 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-06 22:59:16,803 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:59:17,645 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:59:18,074 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-11-06 22:59:18,275 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2020-11-06 22:59:18,519 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2020-11-06 22:59:18,897 WARN L194 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2020-11-06 22:59:19,159 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-11-06 22:59:19,556 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:59:19,777 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-06 22:59:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:59:22,223 INFO L93 Difference]: Finished difference Result 7777 states and 9845 transitions. [2020-11-06 22:59:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:59:22,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 150 [2020-11-06 22:59:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:59:22,240 INFO L225 Difference]: With dead ends: 7777 [2020-11-06 22:59:22,241 INFO L226 Difference]: Without dead ends: 4067 [2020-11-06 22:59:22,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2020-11-06 22:59:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2020-11-06 22:59:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 4061. [2020-11-06 22:59:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4061 states. [2020-11-06 22:59:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5116 transitions. [2020-11-06 22:59:22,936 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5116 transitions. Word has length 150 [2020-11-06 22:59:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:59:22,937 INFO L481 AbstractCegarLoop]: Abstraction has 4061 states and 5116 transitions. [2020-11-06 22:59:22,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:59:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5116 transitions. [2020-11-06 22:59:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-06 22:59:22,939 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:59:22,940 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-11-06 22:59:22,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-06 22:59:22,940 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:59:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:59:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash -430188996, now seen corresponding path program 1 times [2020-11-06 22:59:22,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:59:22,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430677370] [2020-11-06 22:59:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:59:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,413 WARN L194 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:59:23,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:59:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:59:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:59:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:59:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:59:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:59:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:59:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:59:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-06 22:59:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:59:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:59:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:59:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:59:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:59:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:59:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:59:23,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430677370] [2020-11-06 22:59:23,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:59:23,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-06 22:59:23,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576811311] [2020-11-06 22:59:23,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-06 22:59:23,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:59:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-06 22:59:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:59:23,856 INFO L87 Difference]: Start difference. First operand 4061 states and 5116 transitions. Second operand 20 states. [2020-11-06 22:59:24,501 WARN L194 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2020-11-06 22:59:25,363 WARN L194 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 167 [2020-11-06 22:59:25,614 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-11-06 22:59:25,917 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2020-11-06 22:59:26,113 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2020-11-06 22:59:26,636 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-11-06 22:59:26,871 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-06 22:59:27,447 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:59:27,680 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:59:27,886 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:59:28,038 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:59:28,346 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:59:30,928 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:59:31,097 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-06 22:59:31,296 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:59:32,967 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:59:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:59:33,214 INFO L93 Difference]: Finished difference Result 7906 states and 9972 transitions. [2020-11-06 22:59:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:59:33,215 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 150 [2020-11-06 22:59:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:59:33,230 INFO L225 Difference]: With dead ends: 7906 [2020-11-06 22:59:33,230 INFO L226 Difference]: Without dead ends: 4112 [2020-11-06 22:59:33,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2020-11-06 22:59:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2020-11-06 22:59:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 4061. [2020-11-06 22:59:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4061 states. [2020-11-06 22:59:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5111 transitions. [2020-11-06 22:59:33,927 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5111 transitions. Word has length 150 [2020-11-06 22:59:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:59:33,928 INFO L481 AbstractCegarLoop]: Abstraction has 4061 states and 5111 transitions. [2020-11-06 22:59:33,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-06 22:59:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5111 transitions. [2020-11-06 22:59:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-06 22:59:33,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:59:33,930 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, 1] [2020-11-06 22:59:33,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-06 22:59:33,931 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:59:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:59:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash -334479780, now seen corresponding path program 1 times [2020-11-06 22:59:33,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:59:33,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678524719] [2020-11-06 22:59:33,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:59:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,217 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:59:34,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:59:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:59:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:59:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:59:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:59:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:59:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:59:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:59:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:59:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:59:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:59:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:59:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:59:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:59:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:59:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:59:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:59:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:59:34,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678524719] [2020-11-06 22:59:34,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:59:34,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:59:34,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552687318] [2020-11-06 22:59:34,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:59:34,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:59:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:59:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:59:34,617 INFO L87 Difference]: Start difference. First operand 4061 states and 5111 transitions. Second operand 16 states. [2020-11-06 22:59:34,889 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:59:35,358 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:59:36,222 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-06 22:59:36,824 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:59:36,972 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:59:37,256 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:59:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:59:40,502 INFO L93 Difference]: Finished difference Result 7858 states and 9915 transitions. [2020-11-06 22:59:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:59:40,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 151 [2020-11-06 22:59:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:59:40,517 INFO L225 Difference]: With dead ends: 7858 [2020-11-06 22:59:40,517 INFO L226 Difference]: Without dead ends: 4079 [2020-11-06 22:59:40,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:59:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2020-11-06 22:59:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 4061. [2020-11-06 22:59:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4061 states. [2020-11-06 22:59:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5106 transitions. [2020-11-06 22:59:41,314 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5106 transitions. Word has length 151 [2020-11-06 22:59:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:59:41,314 INFO L481 AbstractCegarLoop]: Abstraction has 4061 states and 5106 transitions. [2020-11-06 22:59:41,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:59:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5106 transitions. [2020-11-06 22:59:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-06 22:59:41,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:59:41,316 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, 1] [2020-11-06 22:59:41,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-06 22:59:41,317 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:59:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:59:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1066447206, now seen corresponding path program 1 times [2020-11-06 22:59:41,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:59:41,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546534363] [2020-11-06 22:59:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:59:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:59:41,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:59:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:59:41,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:59:41,577 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:59:41,577 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:59:41,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-06 22:59:41,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:59:41 BoogieIcfgContainer [2020-11-06 22:59:41,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:59:41,923 INFO L168 Benchmark]: Toolchain (without parser) took 187145.74 ms. Allocated memory was 153.1 MB in the beginning and 857.7 MB in the end (delta: 704.6 MB). Free memory was 128.1 MB in the beginning and 338.1 MB in the end (delta: -210.0 MB). Peak memory consumption was 495.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:59:41,923 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 153.1 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:59:41,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.51 ms. Allocated memory is still 153.1 MB. Free memory was 127.5 MB in the beginning and 109.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:59:41,924 INFO L168 Benchmark]: Boogie Preprocessor took 159.30 ms. Allocated memory is still 153.1 MB. Free memory was 109.4 MB in the beginning and 106.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:59:41,924 INFO L168 Benchmark]: RCFGBuilder took 1116.99 ms. Allocated memory is still 153.1 MB. Free memory was 106.3 MB in the beginning and 81.6 MB in the end (delta: 24.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:59:41,925 INFO L168 Benchmark]: TraceAbstraction took 185338.52 ms. Allocated memory was 153.1 MB in the beginning and 857.7 MB in the end (delta: 704.6 MB). Free memory was 81.1 MB in the beginning and 338.1 MB in the end (delta: -257.0 MB). Peak memory consumption was 447.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:59:41,927 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 153.1 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 518.51 ms. Allocated memory is still 153.1 MB. Free memory was 127.5 MB in the beginning and 109.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 159.30 ms. Allocated memory is still 153.1 MB. Free memory was 109.4 MB in the beginning and 106.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1116.99 ms. Allocated memory is still 153.1 MB. Free memory was 106.3 MB in the beginning and 81.6 MB in the end (delta: 24.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 185338.52 ms. Allocated memory was 153.1 MB in the beginning and 857.7 MB in the end (delta: 704.6 MB). Free memory was 81.1 MB in the beginning and 338.1 MB in the end (delta: -257.0 MB). Peak memory consumption was 447.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] msg_t nomsg = (msg_t )-1; [L72] port_t cs1 ; [L73] int8_t cs1_old ; [L74] int8_t cs1_new ; [L75] port_t cs2 ; [L76] int8_t cs2_old ; [L77] int8_t cs2_new ; [L78] port_t s1s2 ; [L79] int8_t s1s2_old ; [L80] int8_t s1s2_new ; [L81] port_t s1s1 ; [L82] int8_t s1s1_old ; [L83] int8_t s1s1_new ; [L84] port_t s2s1 ; [L85] int8_t s2s1_old ; [L86] int8_t s2s1_new ; [L87] port_t s2s2 ; [L88] int8_t s2s2_old ; [L89] int8_t s2s2_new ; [L90] port_t s1p ; [L91] int8_t s1p_old ; [L92] int8_t s1p_new ; [L93] port_t s2p ; [L94] int8_t s2p_old ; [L95] int8_t s2p_new ; [L98] _Bool side1Failed ; [L99] _Bool side2Failed ; [L100] msg_t side1_written ; [L101] msg_t side2_written ; [L107] static _Bool side1Failed_History_0 ; [L108] static _Bool side1Failed_History_1 ; [L109] static _Bool side1Failed_History_2 ; [L110] static _Bool side2Failed_History_0 ; [L111] static _Bool side2Failed_History_1 ; [L112] static _Bool side2Failed_History_2 ; [L113] static int8_t active_side_History_0 ; [L114] static int8_t active_side_History_1 ; [L115] static int8_t active_side_History_2 ; [L116] static msg_t manual_selection_History_0 ; [L117] static msg_t manual_selection_History_1 ; [L118] static msg_t manual_selection_History_2 ; [L468] 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)=71, \old(active_side_History_1)=64, \old(active_side_History_2)=57, \old(cs1)=60, \old(cs1_new)=56, \old(cs1_old)=99, \old(cs2)=68, \old(cs2_new)=84, \old(cs2_old)=65, \old(manual_selection_History_0)=67, \old(manual_selection_History_1)=62, \old(manual_selection_History_2)=89, \old(nomsg)=90, \old(s1p)=69, \old(s1p_new)=55, \old(s1p_old)=77, \old(s1s1)=79, \old(s1s1_new)=102, \old(s1s1_old)=87, \old(s1s2)=73, \old(s1s2_new)=70, \old(s1s2_old)=54, \old(s2p)=91, \old(s2p_new)=94, \old(s2p_old)=59, \old(s2s1)=95, \old(s2s1_new)=88, \old(s2s1_old)=100, \old(s2s2)=58, \old(s2s2_new)=98, \old(s2s2_old)=72, \old(side1_written)=83, \old(side1Failed)=53, \old(side1Failed_History_0)=97, \old(side1Failed_History_1)=103, \old(side1Failed_History_2)=82, \old(side2_written)=74, \old(side2Failed)=96, \old(side2Failed_History_0)=75, \old(side2Failed_History_1)=85, \old(side2Failed_History_2)=63, 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] [L590] int c1 ; [L591] int i2 ; [L594] c1 = 0 [L595] side1Failed = __VERIFIER_nondet_bool() [L596] side2Failed = __VERIFIER_nondet_bool() [L597] side1_written = __VERIFIER_nondet_char() [L598] side2_written = __VERIFIER_nondet_char() [L599] side1Failed_History_0 = __VERIFIER_nondet_bool() [L600] side1Failed_History_1 = __VERIFIER_nondet_bool() [L601] side1Failed_History_2 = __VERIFIER_nondet_bool() [L602] side2Failed_History_0 = __VERIFIER_nondet_bool() [L603] side2Failed_History_1 = __VERIFIER_nondet_bool() [L604] side2Failed_History_2 = __VERIFIER_nondet_bool() [L605] active_side_History_0 = __VERIFIER_nondet_char() [L606] active_side_History_1 = __VERIFIER_nondet_char() [L607] active_side_History_2 = __VERIFIER_nondet_char() [L608] manual_selection_History_0 = __VERIFIER_nondet_char() [L609] manual_selection_History_1 = __VERIFIER_nondet_char() [L610] manual_selection_History_2 = __VERIFIER_nondet_char() [L611] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L244] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L247] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L250] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L253] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L256] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L262] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L265] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L268] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L271] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L274] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !((int )manual_selection_History_2 != 0) [L280] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] i2 = init() [L612] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L105] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L612] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L613] cs1_old = nomsg [L614] cs1_new = nomsg [L615] cs2_old = nomsg [L616] cs2_new = nomsg [L617] s1s2_old = nomsg [L618] s1s2_new = nomsg [L619] s1s1_old = nomsg [L620] s1s1_new = nomsg [L621] s2s1_old = nomsg [L622] s2s1_new = nomsg [L623] s2s2_old = nomsg [L624] s2s2_new = nomsg [L625] s1p_old = nomsg [L626] s1p_new = nomsg [L627] s2p_old = nomsg [L628] s2p_new = nomsg [L629] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] COND TRUE 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] 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=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L304] 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)=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] 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)=-128, 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=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L304] 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=-128, manual_selection_History_0=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L305] 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=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L632] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-3, side1Failed=86, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L323] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L323] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L324] COND FALSE !(\read(side1Failed)) [L331] side1 = s1s1_old [L332] s1s1_old = nomsg [L333] side2 = s2s1_old [L334] s2s1_old = nomsg [L335] manual_selection = cs1_old [L336] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L337] COND TRUE (int )side1 == (int )side2 [L338] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L362] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L362] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L363] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L363] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L364] 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)=-3, \old(side1Failed)=86, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L634] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=61, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L380] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L380] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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] [L381] COND FALSE !(\read(side2Failed)) [L388] side1 = s1s2_old [L389] s1s2_old = nomsg [L390] side2 = s2s2_old [L391] s2s2_old = nomsg [L392] manual_selection = cs2_old [L393] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L394] COND TRUE (int )side1 == (int )side2 [L395] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L418] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L418] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L419] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L419] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L420] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L420] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L421] 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)=61, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L634] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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] [L635] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L433] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L195] COND TRUE (int )index == 0 [L196] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, 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] [L433] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L441] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L444] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L447] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L455] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L456] COND FALSE !((int )side2 == 0) [L459] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L464] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L464] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L635] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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] [L636] cs1_old = cs1_new [L637] cs1_new = nomsg [L638] cs2_old = cs2_new [L639] cs2_new = nomsg [L640] s1s2_old = s1s2_new [L641] s1s2_new = nomsg [L642] s1s1_old = s1s1_new [L643] s1s1_new = nomsg [L644] s2s1_old = s2s1_new [L645] s2s1_new = nomsg [L646] s2s2_old = s2s2_new [L647] s2s2_new = nomsg [L648] s1p_old = s1p_new [L649] s1p_new = nomsg [L650] s2p_old = s2p_new [L651] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, 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] [L652] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L471] int tmp ; [L472] msg_t tmp___0 ; [L473] _Bool tmp___1 ; [L474] _Bool tmp___2 ; [L475] _Bool tmp___3 ; [L476] _Bool tmp___4 ; [L477] int8_t tmp___5 ; [L478] _Bool tmp___6 ; [L479] _Bool tmp___7 ; [L480] _Bool tmp___8 ; [L481] int8_t tmp___9 ; [L482] _Bool tmp___10 ; [L483] _Bool tmp___11 ; [L484] _Bool tmp___12 ; [L485] msg_t tmp___13 ; [L486] _Bool tmp___14 ; [L487] _Bool tmp___15 ; [L488] _Bool tmp___16 ; [L489] _Bool tmp___17 ; [L490] int8_t tmp___18 ; [L491] int8_t tmp___19 ; [L492] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L495] COND TRUE ! side1Failed [L496] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L503] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L105] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L503] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L504] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L225] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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] [L228] COND TRUE (int )index == 1 [L229] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L504] tmp___0 = read_manual_selection_history((unsigned char)1) [L505] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L506] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L135] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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] [L138] COND TRUE (int )index == 1 [L139] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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)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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L506] tmp___1 = read_side1_failed_history((unsigned char)1) [L507] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L508] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L135] COND TRUE (int )index == 0 [L136] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L508] tmp___2 = read_side1_failed_history((unsigned char)0) [L509] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L510] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L165] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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] [L168] COND TRUE (int )index == 1 [L169] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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)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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L510] tmp___3 = read_side2_failed_history((unsigned char)1) [L511] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L512] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L165] COND TRUE (int )index == 0 [L166] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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] [L512] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L512] tmp___4 = read_side2_failed_history((unsigned char)0) [L513] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L514] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L519] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L524] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L525] COND TRUE ! ((int )side2_written == 0) [L526] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L652] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, 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] [L652] c1 = check() [L653] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L664] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L666] CALL reach_error() 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c", 3, "reach_error") 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 21 procedures, 246 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 184.9s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 159.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7496 SDtfs, 37577 SDslu, 3858 SDs, 0 SdLazy, 44893 SolverSat, 14149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1569 GetRequests, 782 SyntacticMatches, 16 SemanticMatches, 771 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5118 ImplicationChecksByTransitivity, 72.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4113occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 4908 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 3272 NumberOfCodeBlocks, 3272 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3096 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 191/191 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...