/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 17:05:32,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 17:05:32,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 17:05:32,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 17:05:32,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 17:05:32,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 17:05:32,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 17:05:32,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 17:05:32,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 17:05:32,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 17:05:32,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 17:05:32,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 17:05:32,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 17:05:32,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 17:05:32,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 17:05:32,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 17:05:32,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 17:05:32,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 17:05:32,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 17:05:32,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 17:05:32,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 17:05:32,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 17:05:32,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 17:05:32,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 17:05:32,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 17:05:32,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 17:05:32,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 17:05:32,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 17:05:32,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 17:05:32,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 17:05:32,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 17:05:32,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 17:05:32,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 17:05:32,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 17:05:32,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 17:05:32,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 17:05:32,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 17:05:32,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 17:05:32,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 17:05:32,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 17:05:32,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 17:05:32,468 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-08-22 17:05:32,513 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 17:05:32,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 17:05:32,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 17:05:32,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 17:05:32,517 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 17:05:32,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 17:05:32,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 17:05:32,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 17:05:32,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 17:05:32,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 17:05:32,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 17:05:32,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 17:05:32,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 17:05:32,521 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 17:05:32,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 17:05:32,522 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 17:05:32,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 17:05:32,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 17:05:32,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 17:05:32,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 17:05:32,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 17:05:32,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 17:05:32,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 17:05:32,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 17:05:32,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 17:05:32,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 17:05:32,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 17:05:32,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 17:05:32,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 17:05:32,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 17:05:32,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 17:05:32,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 17:05:32,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 17:05:32,886 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 17:05:32,886 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 17:05:32,888 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-08-22 17:05:32,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dadf82c/a04f95163c5d4fa89b483d21fa1c7e9a/FLAGfd11eddfb [2020-08-22 17:05:33,563 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 17:05:33,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-08-22 17:05:33,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dadf82c/a04f95163c5d4fa89b483d21fa1c7e9a/FLAGfd11eddfb [2020-08-22 17:05:33,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dadf82c/a04f95163c5d4fa89b483d21fa1c7e9a [2020-08-22 17:05:33,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 17:05:33,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 17:05:33,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 17:05:33,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 17:05:33,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 17:05:33,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:05:33" (1/1) ... [2020-08-22 17:05:33,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15979b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:33, skipping insertion in model container [2020-08-22 17:05:33,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:05:33" (1/1) ... [2020-08-22 17:05:33,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 17:05:34,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 17:05:34,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:05:34,498 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 17:05:34,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:05:34,608 INFO L208 MainTranslator]: Completed translation [2020-08-22 17:05:34,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34 WrapperNode [2020-08-22 17:05:34,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 17:05:34,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 17:05:34,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 17:05:34,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 17:05:34,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (1/1) ... [2020-08-22 17:05:34,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 17:05:34,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 17:05:34,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 17:05:34,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 17:05:34,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (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-08-22 17:05:34,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 17:05:34,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 17:05:34,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 17:05:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-08-22 17:05:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-08-22 17:05:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-08-22 17:05:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-08-22 17:05:34,808 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-08-22 17:05:34,808 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-08-22 17:05:34,808 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-08-22 17:05:34,808 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-08-22 17:05:34,808 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-08-22 17:05:34,809 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-08-22 17:05:34,809 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-08-22 17:05:34,809 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-08-22 17:05:34,809 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-08-22 17:05:34,809 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-08-22 17:05:34,810 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-08-22 17:05:34,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 17:05:34,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-08-22 17:05:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 17:05:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-22 17:05:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-08-22 17:05:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-08-22 17:05:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-08-22 17:05:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-08-22 17:05:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 17:05:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 17:05:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-08-22 17:05:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-08-22 17:05:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-08-22 17:05:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-08-22 17:05:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-08-22 17:05:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-08-22 17:05:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-08-22 17:05:34,814 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-08-22 17:05:34,814 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-08-22 17:05:34,814 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-08-22 17:05:34,814 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-08-22 17:05:34,814 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-08-22 17:05:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-08-22 17:05:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-08-22 17:05:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-08-22 17:05:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 17:05:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 17:05:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 17:05:35,994 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 17:05:35,994 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 17:05:36,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:05:36 BoogieIcfgContainer [2020-08-22 17:05:36,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 17:05:36,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 17:05:36,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 17:05:36,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 17:05:36,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 05:05:33" (1/3) ... [2020-08-22 17:05:36,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2031fc55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:05:36, skipping insertion in model container [2020-08-22 17:05:36,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:34" (2/3) ... [2020-08-22 17:05:36,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2031fc55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:05:36, skipping insertion in model container [2020-08-22 17:05:36,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:05:36" (3/3) ... [2020-08-22 17:05:36,014 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-08-22 17:05:36,027 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 17:05:36,036 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 17:05:36,052 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 17:05:36,085 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 17:05:36,086 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 17:05:36,086 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 17:05:36,086 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 17:05:36,087 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 17:05:36,087 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 17:05:36,087 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 17:05:36,087 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 17:05:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2020-08-22 17:05:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-08-22 17:05:36,135 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:36,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:36,137 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1549655252, now seen corresponding path program 1 times [2020-08-22 17:05:36,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:36,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407666813] [2020-08-22 17:05:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,772 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:36,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 17:05:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:36,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:37,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 17:05:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:37,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:05:37,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407666813] [2020-08-22 17:05:37,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:37,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:05:37,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535632340] [2020-08-22 17:05:37,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:05:37,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:37,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:05:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:05:37,111 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 9 states. [2020-08-22 17:05:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:39,190 INFO L93 Difference]: Finished difference Result 456 states and 705 transitions. [2020-08-22 17:05:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:05:39,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-08-22 17:05:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:39,212 INFO L225 Difference]: With dead ends: 456 [2020-08-22 17:05:39,212 INFO L226 Difference]: Without dead ends: 237 [2020-08-22 17:05:39,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:05:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-08-22 17:05:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-08-22 17:05:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-08-22 17:05:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 342 transitions. [2020-08-22 17:05:39,334 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 342 transitions. Word has length 71 [2020-08-22 17:05:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:39,335 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 342 transitions. [2020-08-22 17:05:39,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:05:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 342 transitions. [2020-08-22 17:05:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-08-22 17:05:39,341 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:39,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:39,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 17:05:39,342 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 695502060, now seen corresponding path program 1 times [2020-08-22 17:05:39,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:39,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908993982] [2020-08-22 17:05:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,616 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:39,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 17:05:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 17:05:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:05:39,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908993982] [2020-08-22 17:05:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:39,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 17:05:39,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21043552] [2020-08-22 17:05:39,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 17:05:39,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:39,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 17:05:39,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:05:39,955 INFO L87 Difference]: Start difference. First operand 237 states and 342 transitions. Second operand 14 states. [2020-08-22 17:05:40,185 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:40,441 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:40,630 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:05:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:43,385 INFO L93 Difference]: Finished difference Result 455 states and 653 transitions. [2020-08-22 17:05:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 17:05:43,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-08-22 17:05:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:43,389 INFO L225 Difference]: With dead ends: 455 [2020-08-22 17:05:43,390 INFO L226 Difference]: Without dead ends: 237 [2020-08-22 17:05:43,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:05:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-08-22 17:05:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-08-22 17:05:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-08-22 17:05:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2020-08-22 17:05:43,444 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 71 [2020-08-22 17:05:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:43,444 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2020-08-22 17:05:43,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 17:05:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2020-08-22 17:05:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-22 17:05:43,449 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:43,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:43,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 17:05:43,450 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1333871800, now seen corresponding path program 1 times [2020-08-22 17:05:43,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:43,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131650503] [2020-08-22 17:05:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,762 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:43,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:05:44,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131650503] [2020-08-22 17:05:44,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:44,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 17:05:44,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951266494] [2020-08-22 17:05:44,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 17:05:44,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:44,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 17:05:44,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:05:44,019 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 11 states. [2020-08-22 17:05:44,998 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:45,137 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:05:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:46,447 INFO L93 Difference]: Finished difference Result 454 states and 645 transitions. [2020-08-22 17:05:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:05:46,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-22 17:05:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:46,457 INFO L225 Difference]: With dead ends: 454 [2020-08-22 17:05:46,457 INFO L226 Difference]: Without dead ends: 241 [2020-08-22 17:05:46,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-08-22 17:05:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-08-22 17:05:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-08-22 17:05:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-08-22 17:05:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2020-08-22 17:05:46,523 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 82 [2020-08-22 17:05:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:46,524 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2020-08-22 17:05:46,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 17:05:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2020-08-22 17:05:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-08-22 17:05:46,528 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:46,528 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:46,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 17:05:46,529 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1250466386, now seen corresponding path program 1 times [2020-08-22 17:05:46,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:46,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710824096] [2020-08-22 17:05:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,765 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:46,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:46,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:05:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:05:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:47,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710824096] [2020-08-22 17:05:47,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:47,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:05:47,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30015476] [2020-08-22 17:05:47,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:05:47,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:47,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:05:47,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:05:47,087 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand 16 states. [2020-08-22 17:05:47,277 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:05:48,620 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-08-22 17:05:48,745 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-08-22 17:05:49,297 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:51,368 INFO L93 Difference]: Finished difference Result 549 states and 758 transitions. [2020-08-22 17:05:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:05:51,369 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-08-22 17:05:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:51,376 INFO L225 Difference]: With dead ends: 549 [2020-08-22 17:05:51,376 INFO L226 Difference]: Without dead ends: 332 [2020-08-22 17:05:51,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:05:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-08-22 17:05:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2020-08-22 17:05:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-08-22 17:05:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-08-22 17:05:51,429 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 104 [2020-08-22 17:05:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:51,430 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-08-22 17:05:51,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:05:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-08-22 17:05:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 17:05:51,433 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:51,433 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-08-22 17:05:51,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 17:05:51,434 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1479117531, now seen corresponding path program 1 times [2020-08-22 17:05:51,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:51,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100672939] [2020-08-22 17:05:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,677 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:51,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:52,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 17:05:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:52,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 17:05:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:52,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100672939] [2020-08-22 17:05:52,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:52,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:05:52,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853164378] [2020-08-22 17:05:52,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:05:52,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:05:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:05:52,055 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 16 states. [2020-08-22 17:05:52,321 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:05:54,330 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:56,415 INFO L93 Difference]: Finished difference Result 555 states and 766 transitions. [2020-08-22 17:05:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:05:56,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-08-22 17:05:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:56,420 INFO L225 Difference]: With dead ends: 555 [2020-08-22 17:05:56,420 INFO L226 Difference]: Without dead ends: 335 [2020-08-22 17:05:56,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:05:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-08-22 17:05:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2020-08-22 17:05:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-08-22 17:05:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-08-22 17:05:56,465 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 105 [2020-08-22 17:05:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:56,466 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-08-22 17:05:56,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:05:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-08-22 17:05:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-08-22 17:05:56,469 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:56,469 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:56,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 17:05:56,470 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash -717194829, now seen corresponding path program 1 times [2020-08-22 17:05:56,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:56,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640318131] [2020-08-22 17:05:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,681 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:56,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-22 17:05:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:56,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640318131] [2020-08-22 17:05:56,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:56,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:05:56,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350875415] [2020-08-22 17:05:56,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:05:56,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:05:56,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:56,973 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 12 states. [2020-08-22 17:05:57,726 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:00,772 INFO L93 Difference]: Finished difference Result 788 states and 1093 transitions. [2020-08-22 17:06:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:06:00,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-08-22 17:06:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:00,780 INFO L225 Difference]: With dead ends: 788 [2020-08-22 17:06:00,780 INFO L226 Difference]: Without dead ends: 568 [2020-08-22 17:06:00,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:06:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-08-22 17:06:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 551. [2020-08-22 17:06:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-08-22 17:06:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 759 transitions. [2020-08-22 17:06:00,868 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 759 transitions. Word has length 107 [2020-08-22 17:06:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:00,869 INFO L479 AbstractCegarLoop]: Abstraction has 551 states and 759 transitions. [2020-08-22 17:06:00,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:06:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 759 transitions. [2020-08-22 17:06:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-08-22 17:06:00,871 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:00,871 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-08-22 17:06:00,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 17:06:00,872 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash 654438841, now seen corresponding path program 1 times [2020-08-22 17:06:00,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:00,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238985450] [2020-08-22 17:06:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,049 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:01,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:01,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238985450] [2020-08-22 17:06:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:06:01,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162406255] [2020-08-22 17:06:01,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:06:01,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:06:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:06:01,311 INFO L87 Difference]: Start difference. First operand 551 states and 759 transitions. Second operand 12 states. [2020-08-22 17:06:02,753 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:05,600 INFO L93 Difference]: Finished difference Result 1308 states and 1846 transitions. [2020-08-22 17:06:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:06:05,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-08-22 17:06:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:05,609 INFO L225 Difference]: With dead ends: 1308 [2020-08-22 17:06:05,610 INFO L226 Difference]: Without dead ends: 911 [2020-08-22 17:06:05,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:06:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2020-08-22 17:06:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 905. [2020-08-22 17:06:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2020-08-22 17:06:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1266 transitions. [2020-08-22 17:06:05,732 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1266 transitions. Word has length 108 [2020-08-22 17:06:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:05,733 INFO L479 AbstractCegarLoop]: Abstraction has 905 states and 1266 transitions. [2020-08-22 17:06:05,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:06:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1266 transitions. [2020-08-22 17:06:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 17:06:05,736 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:05,736 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-08-22 17:06:05,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 17:06:05,736 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 925446042, now seen corresponding path program 1 times [2020-08-22 17:06:05,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:05,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663986930] [2020-08-22 17:06:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:05,940 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:05,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:05,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:05,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:05,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:05,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:06:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:06:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:06,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663986930] [2020-08-22 17:06:06,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:06,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:06:06,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150671437] [2020-08-22 17:06:06,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:06:06,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:06,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:06:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:06:06,236 INFO L87 Difference]: Start difference. First operand 905 states and 1266 transitions. Second operand 12 states. [2020-08-22 17:06:06,438 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:10,183 INFO L93 Difference]: Finished difference Result 1649 states and 2335 transitions. [2020-08-22 17:06:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:06:10,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-08-22 17:06:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:10,192 INFO L225 Difference]: With dead ends: 1649 [2020-08-22 17:06:10,192 INFO L226 Difference]: Without dead ends: 916 [2020-08-22 17:06:10,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:06:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-08-22 17:06:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 910. [2020-08-22 17:06:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-08-22 17:06:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1268 transitions. [2020-08-22 17:06:10,373 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1268 transitions. Word has length 109 [2020-08-22 17:06:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:10,375 INFO L479 AbstractCegarLoop]: Abstraction has 910 states and 1268 transitions. [2020-08-22 17:06:10,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:06:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1268 transitions. [2020-08-22 17:06:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-08-22 17:06:10,380 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:10,380 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-08-22 17:06:10,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 17:06:10,381 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash -625424837, now seen corresponding path program 1 times [2020-08-22 17:06:10,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:10,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25521909] [2020-08-22 17:06:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,640 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:10,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:10,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25521909] [2020-08-22 17:06:10,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:10,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:10,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091194259] [2020-08-22 17:06:10,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:10,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:10,950 INFO L87 Difference]: Start difference. First operand 910 states and 1268 transitions. Second operand 13 states. [2020-08-22 17:06:12,646 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:12,805 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:13,813 INFO L93 Difference]: Finished difference Result 1663 states and 2354 transitions. [2020-08-22 17:06:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:13,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-08-22 17:06:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:13,820 INFO L225 Difference]: With dead ends: 1663 [2020-08-22 17:06:13,821 INFO L226 Difference]: Without dead ends: 930 [2020-08-22 17:06:13,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-08-22 17:06:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2020-08-22 17:06:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-08-22 17:06:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1284 transitions. [2020-08-22 17:06:13,941 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1284 transitions. Word has length 108 [2020-08-22 17:06:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:13,942 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1284 transitions. [2020-08-22 17:06:13,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1284 transitions. [2020-08-22 17:06:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-08-22 17:06:13,945 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:13,945 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-08-22 17:06:13,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 17:06:13,946 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 442586826, now seen corresponding path program 1 times [2020-08-22 17:06:13,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:13,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942249408] [2020-08-22 17:06:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,176 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:14,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:06:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:06:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:06:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-08-22 17:06:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:14,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942249408] [2020-08-22 17:06:14,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:14,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:06:14,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277109600] [2020-08-22 17:06:14,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:06:14,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:06:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:06:14,429 INFO L87 Difference]: Start difference. First operand 930 states and 1284 transitions. Second operand 12 states. [2020-08-22 17:06:14,566 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:18,529 INFO L93 Difference]: Finished difference Result 1715 states and 2391 transitions. [2020-08-22 17:06:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:06:18,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2020-08-22 17:06:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:18,537 INFO L225 Difference]: With dead ends: 1715 [2020-08-22 17:06:18,537 INFO L226 Difference]: Without dead ends: 962 [2020-08-22 17:06:18,541 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:06:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-08-22 17:06:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 930. [2020-08-22 17:06:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-08-22 17:06:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1280 transitions. [2020-08-22 17:06:18,657 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1280 transitions. Word has length 117 [2020-08-22 17:06:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:18,657 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1280 transitions. [2020-08-22 17:06:18,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:06:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1280 transitions. [2020-08-22 17:06:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-08-22 17:06:18,667 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:18,667 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:18,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 17:06:18,668 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash -208311273, now seen corresponding path program 1 times [2020-08-22 17:06:18,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:18,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033780298] [2020-08-22 17:06:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,971 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:18,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:19,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033780298] [2020-08-22 17:06:19,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:19,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:19,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946195362] [2020-08-22 17:06:19,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:19,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:19,289 INFO L87 Difference]: Start difference. First operand 930 states and 1280 transitions. Second operand 13 states. [2020-08-22 17:06:20,827 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:20,981 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:22,060 INFO L93 Difference]: Finished difference Result 1703 states and 2388 transitions. [2020-08-22 17:06:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:22,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-08-22 17:06:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:22,066 INFO L225 Difference]: With dead ends: 1703 [2020-08-22 17:06:22,067 INFO L226 Difference]: Without dead ends: 950 [2020-08-22 17:06:22,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-08-22 17:06:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-08-22 17:06:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-08-22 17:06:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1296 transitions. [2020-08-22 17:06:22,183 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1296 transitions. Word has length 116 [2020-08-22 17:06:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:22,184 INFO L479 AbstractCegarLoop]: Abstraction has 950 states and 1296 transitions. [2020-08-22 17:06:22,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1296 transitions. [2020-08-22 17:06:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-08-22 17:06:22,187 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:22,187 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:22,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 17:06:22,188 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2072056031, now seen corresponding path program 1 times [2020-08-22 17:06:22,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:22,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269554307] [2020-08-22 17:06:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,400 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:22,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:22,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269554307] [2020-08-22 17:06:22,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:22,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:22,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199629622] [2020-08-22 17:06:22,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:22,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:22,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:22,744 INFO L87 Difference]: Start difference. First operand 950 states and 1296 transitions. Second operand 13 states. [2020-08-22 17:06:24,396 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 17:06:24,956 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:25,110 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:25,906 INFO L93 Difference]: Finished difference Result 1739 states and 2404 transitions. [2020-08-22 17:06:25,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:25,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-08-22 17:06:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:25,915 INFO L225 Difference]: With dead ends: 1739 [2020-08-22 17:06:25,915 INFO L226 Difference]: Without dead ends: 966 [2020-08-22 17:06:25,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2020-08-22 17:06:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2020-08-22 17:06:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2020-08-22 17:06:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1308 transitions. [2020-08-22 17:06:26,036 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1308 transitions. Word has length 124 [2020-08-22 17:06:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:26,037 INFO L479 AbstractCegarLoop]: Abstraction has 966 states and 1308 transitions. [2020-08-22 17:06:26,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1308 transitions. [2020-08-22 17:06:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-08-22 17:06:26,040 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:26,041 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:26,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 17:06:26,041 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash 689076351, now seen corresponding path program 1 times [2020-08-22 17:06:26,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:26,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555679611] [2020-08-22 17:06:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,298 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:26,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:26,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555679611] [2020-08-22 17:06:26,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:26,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-08-22 17:06:26,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662444082] [2020-08-22 17:06:26,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 17:06:26,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 17:06:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:06:26,731 INFO L87 Difference]: Start difference. First operand 966 states and 1308 transitions. Second operand 18 states. [2020-08-22 17:06:27,257 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-08-22 17:06:27,502 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:28,109 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:29,797 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:29,952 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:30,095 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:31,770 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:31,938 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:34,849 INFO L93 Difference]: Finished difference Result 2593 states and 3617 transitions. [2020-08-22 17:06:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 17:06:34,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2020-08-22 17:06:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:34,876 INFO L225 Difference]: With dead ends: 2593 [2020-08-22 17:06:34,877 INFO L226 Difference]: Without dead ends: 1792 [2020-08-22 17:06:34,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 17:06:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-08-22 17:06:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1552. [2020-08-22 17:06:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2020-08-22 17:06:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2122 transitions. [2020-08-22 17:06:35,203 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2122 transitions. Word has length 124 [2020-08-22 17:06:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:35,204 INFO L479 AbstractCegarLoop]: Abstraction has 1552 states and 2122 transitions. [2020-08-22 17:06:35,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 17:06:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2122 transitions. [2020-08-22 17:06:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-08-22 17:06:35,210 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:35,210 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, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:35,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 17:06:35,211 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:35,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1938608124, now seen corresponding path program 1 times [2020-08-22 17:06:35,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:35,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459159472] [2020-08-22 17:06:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,554 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:35,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:06:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 17:06:35,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459159472] [2020-08-22 17:06:35,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:35,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:35,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582632614] [2020-08-22 17:06:35,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:35,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:35,958 INFO L87 Difference]: Start difference. First operand 1552 states and 2122 transitions. Second operand 13 states. [2020-08-22 17:06:37,613 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 17:06:38,358 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:38,558 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:39,652 INFO L93 Difference]: Finished difference Result 2817 states and 3930 transitions. [2020-08-22 17:06:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:39,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2020-08-22 17:06:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:39,665 INFO L225 Difference]: With dead ends: 2817 [2020-08-22 17:06:39,666 INFO L226 Difference]: Without dead ends: 1592 [2020-08-22 17:06:39,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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-08-22 17:06:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2020-08-22 17:06:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2020-08-22 17:06:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2020-08-22 17:06:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2154 transitions. [2020-08-22 17:06:39,928 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2154 transitions. Word has length 131 [2020-08-22 17:06:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:39,929 INFO L479 AbstractCegarLoop]: Abstraction has 1592 states and 2154 transitions. [2020-08-22 17:06:39,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2154 transitions. [2020-08-22 17:06:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-08-22 17:06:39,934 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:39,935 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:39,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 17:06:39,935 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash -417494266, now seen corresponding path program 1 times [2020-08-22 17:06:39,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:39,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347332517] [2020-08-22 17:06:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,167 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:40,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:06:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-08-22 17:06:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 17:06:40,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347332517] [2020-08-22 17:06:40,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:40,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:40,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850150645] [2020-08-22 17:06:40,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:40,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:40,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:40,385 INFO L87 Difference]: Start difference. First operand 1592 states and 2154 transitions. Second operand 13 states. [2020-08-22 17:06:42,238 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:42,374 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:43,194 INFO L93 Difference]: Finished difference Result 2877 states and 3942 transitions. [2020-08-22 17:06:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:43,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-08-22 17:06:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:43,209 INFO L225 Difference]: With dead ends: 2877 [2020-08-22 17:06:43,210 INFO L226 Difference]: Without dead ends: 1624 [2020-08-22 17:06:43,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-08-22 17:06:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2020-08-22 17:06:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-08-22 17:06:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2178 transitions. [2020-08-22 17:06:43,426 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2178 transitions. Word has length 139 [2020-08-22 17:06:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:43,426 INFO L479 AbstractCegarLoop]: Abstraction has 1624 states and 2178 transitions. [2020-08-22 17:06:43,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2178 transitions. [2020-08-22 17:06:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 17:06:43,430 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:43,430 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-22 17:06:43,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 17:06:43,431 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash 678570065, now seen corresponding path program 1 times [2020-08-22 17:06:43,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:43,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439240645] [2020-08-22 17:06:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,711 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:43,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:43,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:44,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:06:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:44,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-08-22 17:06:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-08-22 17:06:44,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439240645] [2020-08-22 17:06:44,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:44,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:44,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864887985] [2020-08-22 17:06:44,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:44,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:44,059 INFO L87 Difference]: Start difference. First operand 1624 states and 2178 transitions. Second operand 13 states. [2020-08-22 17:06:46,346 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:46,486 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:47,034 INFO L93 Difference]: Finished difference Result 2785 states and 3746 transitions. [2020-08-22 17:06:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:47,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2020-08-22 17:06:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:47,044 INFO L225 Difference]: With dead ends: 2785 [2020-08-22 17:06:47,045 INFO L226 Difference]: Without dead ends: 1672 [2020-08-22 17:06:47,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2020-08-22 17:06:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2020-08-22 17:06:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2020-08-22 17:06:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2218 transitions. [2020-08-22 17:06:47,247 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2218 transitions. Word has length 140 [2020-08-22 17:06:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:47,248 INFO L479 AbstractCegarLoop]: Abstraction has 1672 states and 2218 transitions. [2020-08-22 17:06:47,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2218 transitions. [2020-08-22 17:06:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-22 17:06:47,252 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:47,253 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:47,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 17:06:47,253 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:47,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1268279286, now seen corresponding path program 1 times [2020-08-22 17:06:47,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:47,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87075336] [2020-08-22 17:06:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,596 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:47,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:06:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:06:48,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87075336] [2020-08-22 17:06:48,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031078456] [2020-08-22 17:06:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:06:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 17:06:48,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:06:48,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-08-22 17:06:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-08-22 17:06:48,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:06:48,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-08-22 17:06:48,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479313778] [2020-08-22 17:06:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:06:48,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:06:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:06:48,600 INFO L87 Difference]: Start difference. First operand 1672 states and 2218 transitions. Second operand 6 states. [2020-08-22 17:06:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:49,856 INFO L93 Difference]: Finished difference Result 3331 states and 4422 transitions. [2020-08-22 17:06:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 17:06:49,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-08-22 17:06:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:49,874 INFO L225 Difference]: With dead ends: 3331 [2020-08-22 17:06:49,875 INFO L226 Difference]: Without dead ends: 1697 [2020-08-22 17:06:49,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2020-08-22 17:06:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2020-08-22 17:06:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1694. [2020-08-22 17:06:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-08-22 17:06:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2236 transitions. [2020-08-22 17:06:50,231 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2236 transitions. Word has length 145 [2020-08-22 17:06:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:50,232 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2236 transitions. [2020-08-22 17:06:50,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:06:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2236 transitions. [2020-08-22 17:06:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-22 17:06:50,236 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:50,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:50,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-08-22 17:06:50,453 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1053522632, now seen corresponding path program 1 times [2020-08-22 17:06:50,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:50,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943182844] [2020-08-22 17:06:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,752 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:50,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:50,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:06:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:06:51,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943182844] [2020-08-22 17:06:51,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989920308] [2020-08-22 17:06:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:06:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:51,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 9 conjunts are in the unsatisfiable core [2020-08-22 17:06:51,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:06:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 17:06:51,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:06:51,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-08-22 17:06:51,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715712920] [2020-08-22 17:06:51,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:06:51,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:51,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:06:51,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:06:51,748 INFO L87 Difference]: Start difference. First operand 1694 states and 2236 transitions. Second operand 6 states. [2020-08-22 17:06:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:53,491 INFO L93 Difference]: Finished difference Result 3205 states and 4246 transitions. [2020-08-22 17:06:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 17:06:53,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-08-22 17:06:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:53,507 INFO L225 Difference]: With dead ends: 3205 [2020-08-22 17:06:53,507 INFO L226 Difference]: Without dead ends: 1718 [2020-08-22 17:06:53,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2020-08-22 17:06:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-08-22 17:06:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1694. [2020-08-22 17:06:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-08-22 17:06:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2232 transitions. [2020-08-22 17:06:54,001 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2232 transitions. Word has length 145 [2020-08-22 17:06:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:54,002 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2232 transitions. [2020-08-22 17:06:54,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:06:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2232 transitions. [2020-08-22 17:06:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-22 17:06:54,009 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:54,009 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:54,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-08-22 17:06:54,222 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:54,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1583047185, now seen corresponding path program 1 times [2020-08-22 17:06:54,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:54,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950122990] [2020-08-22 17:06:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,510 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:54,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:06:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-08-22 17:06:54,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950122990] [2020-08-22 17:06:54,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:54,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:06:54,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710264466] [2020-08-22 17:06:54,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:06:54,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:06:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:06:54,964 INFO L87 Difference]: Start difference. First operand 1694 states and 2232 transitions. Second operand 16 states. [2020-08-22 17:06:55,176 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:55,663 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:06:55,827 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-08-22 17:06:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:59,980 INFO L93 Difference]: Finished difference Result 3217 states and 4266 transitions. [2020-08-22 17:06:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:06:59,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 145 [2020-08-22 17:06:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:59,997 INFO L225 Difference]: With dead ends: 3217 [2020-08-22 17:06:59,997 INFO L226 Difference]: Without dead ends: 1706 [2020-08-22 17:07:00,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:07:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-08-22 17:07:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1694. [2020-08-22 17:07:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-08-22 17:07:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2224 transitions. [2020-08-22 17:07:00,346 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2224 transitions. Word has length 145 [2020-08-22 17:07:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:00,351 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2224 transitions. [2020-08-22 17:07:00,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:07:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2224 transitions. [2020-08-22 17:07:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-08-22 17:07:00,356 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:00,356 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-08-22 17:07:00,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-22 17:07:00,357 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:00,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2065307551, now seen corresponding path program 1 times [2020-08-22 17:07:00,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:00,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620146970] [2020-08-22 17:07:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,613 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:00,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:07:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:07:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 17:07:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:07:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:07:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:07:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:07:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:07:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:00,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:07:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-08-22 17:07:01,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620146970] [2020-08-22 17:07:01,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:07:01,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:07:01,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140571876] [2020-08-22 17:07:01,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:07:01,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:01,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:07:01,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:07:01,018 INFO L87 Difference]: Start difference. First operand 1694 states and 2224 transitions. Second operand 16 states. [2020-08-22 17:07:01,245 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:07:01,853 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:07:02,017 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-08-22 17:07:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:06,269 INFO L93 Difference]: Finished difference Result 3185 states and 4214 transitions. [2020-08-22 17:07:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:07:06,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 146 [2020-08-22 17:07:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:06,282 INFO L225 Difference]: With dead ends: 3185 [2020-08-22 17:07:06,283 INFO L226 Difference]: Without dead ends: 1706 [2020-08-22 17:07:06,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:07:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-08-22 17:07:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1694. [2020-08-22 17:07:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-08-22 17:07:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2220 transitions. [2020-08-22 17:07:06,522 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2220 transitions. Word has length 146 [2020-08-22 17:07:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:06,523 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2220 transitions. [2020-08-22 17:07:06,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:07:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2220 transitions. [2020-08-22 17:07:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-08-22 17:07:06,526 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:06,527 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-08-22 17:07:06,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-22 17:07:06,527 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1647910945, now seen corresponding path program 1 times [2020-08-22 17:07:06,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:06,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618183398] [2020-08-22 17:07:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:06,833 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:06,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:06,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:06,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:06,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:06,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:06,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:07:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:07:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 17:07:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:07:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:07:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:07:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:07:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:07:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:07:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:07:07,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618183398] [2020-08-22 17:07:07,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694297885] [2020-08-22 17:07:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:07:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:07,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 7 conjunts are in the unsatisfiable core [2020-08-22 17:07:07,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:07:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 17:07:07,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:07:07,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 22 [2020-08-22 17:07:07,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761549035] [2020-08-22 17:07:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 17:07:07,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 17:07:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:07:07,733 INFO L87 Difference]: Start difference. First operand 1694 states and 2220 transitions. Second operand 5 states. [2020-08-22 17:07:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:07,978 INFO L93 Difference]: Finished difference Result 2413 states and 3170 transitions. [2020-08-22 17:07:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 17:07:07,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2020-08-22 17:07:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:07,987 INFO L225 Difference]: With dead ends: 2413 [2020-08-22 17:07:07,987 INFO L226 Difference]: Without dead ends: 1334 [2020-08-22 17:07:07,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:07:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2020-08-22 17:07:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2020-08-22 17:07:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-08-22 17:07:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1747 transitions. [2020-08-22 17:07:08,140 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1747 transitions. Word has length 146 [2020-08-22 17:07:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:08,140 INFO L479 AbstractCegarLoop]: Abstraction has 1334 states and 1747 transitions. [2020-08-22 17:07:08,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 17:07:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1747 transitions. [2020-08-22 17:07:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-08-22 17:07:08,143 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:08,143 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-08-22 17:07:08,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:07:08,356 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -263464484, now seen corresponding path program 1 times [2020-08-22 17:07:08,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:08,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285883024] [2020-08-22 17:07:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,644 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:08,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:07:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:07:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:07:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:07:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 17:07:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:07:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:07:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-08-22 17:07:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 17:07:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:07:09,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285883024] [2020-08-22 17:07:09,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973943506] [2020-08-22 17:07:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:07:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjunts are in the unsatisfiable core [2020-08-22 17:07:09,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:07:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:07:09,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 17:07:09,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 22 [2020-08-22 17:07:09,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865787869] [2020-08-22 17:07:09,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-22 17:07:09,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-22 17:07:09,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:07:09,551 INFO L87 Difference]: Start difference. First operand 1334 states and 1747 transitions. Second operand 22 states. [2020-08-22 17:07:09,808 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-08-22 17:07:09,988 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:07:11,076 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:07:12,692 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:07:12,882 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:07:13,055 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:07:13,896 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-08-22 17:07:15,164 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:07:15,350 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:07:15,532 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:07:15,744 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:15,939 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:07:16,152 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:20,573 INFO L93 Difference]: Finished difference Result 3162 states and 4158 transitions. [2020-08-22 17:07:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-08-22 17:07:20,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2020-08-22 17:07:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:20,590 INFO L225 Difference]: With dead ends: 3162 [2020-08-22 17:07:20,590 INFO L226 Difference]: Without dead ends: 2134 [2020-08-22 17:07:20,595 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=564, Invalid=2192, Unknown=0, NotChecked=0, Total=2756 [2020-08-22 17:07:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2020-08-22 17:07:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2030. [2020-08-22 17:07:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2020-08-22 17:07:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2668 transitions. [2020-08-22 17:07:20,831 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2668 transitions. Word has length 146 [2020-08-22 17:07:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:20,831 INFO L479 AbstractCegarLoop]: Abstraction has 2030 states and 2668 transitions. [2020-08-22 17:07:20,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-22 17:07:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2668 transitions. [2020-08-22 17:07:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-08-22 17:07:20,834 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:20,835 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-08-22 17:07:21,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:07:21,050 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 981502446, now seen corresponding path program 1 times [2020-08-22 17:07:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:21,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148069435] [2020-08-22 17:07:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,271 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:21,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:07:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:07:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:07:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:07:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 17:07:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:07:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:07:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:07:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-08-22 17:07:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 17:07:21,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148069435] [2020-08-22 17:07:21,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:07:21,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 17:07:21,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103406149] [2020-08-22 17:07:21,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 17:07:21,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 17:07:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:07:21,637 INFO L87 Difference]: Start difference. First operand 2030 states and 2668 transitions. Second operand 14 states. [2020-08-22 17:07:21,833 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:07:23,019 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:07:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:28,602 INFO L93 Difference]: Finished difference Result 6354 states and 8412 transitions. [2020-08-22 17:07:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 17:07:28,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2020-08-22 17:07:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:28,631 INFO L225 Difference]: With dead ends: 6354 [2020-08-22 17:07:28,631 INFO L226 Difference]: Without dead ends: 4617 [2020-08-22 17:07:28,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-08-22 17:07:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2020-08-22 17:07:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 4356. [2020-08-22 17:07:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4356 states. [2020-08-22 17:07:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 5712 transitions. [2020-08-22 17:07:29,162 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 5712 transitions. Word has length 147 [2020-08-22 17:07:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:29,163 INFO L479 AbstractCegarLoop]: Abstraction has 4356 states and 5712 transitions. [2020-08-22 17:07:29,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 17:07:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 5712 transitions. [2020-08-22 17:07:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-08-22 17:07:29,167 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:29,168 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:07:29,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-08-22 17:07:29,168 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash -261787196, now seen corresponding path program 1 times [2020-08-22 17:07:29,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:29,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326669530] [2020-08-22 17:07:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,408 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:29,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:07:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:07:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:07:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:07:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:07:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:07:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:07:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-08-22 17:07:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 17:07:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-08-22 17:07:29,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326669530] [2020-08-22 17:07:29,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:07:29,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-08-22 17:07:29,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920085494] [2020-08-22 17:07:29,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 17:07:29,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:29,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 17:07:29,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:07:29,941 INFO L87 Difference]: Start difference. First operand 4356 states and 5712 transitions. Second operand 18 states. [2020-08-22 17:07:30,588 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-08-22 17:07:30,888 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-08-22 17:07:32,329 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-08-22 17:07:32,653 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-08-22 17:07:33,969 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-08-22 17:07:34,107 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-08-22 17:07:35,273 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-08-22 17:07:35,488 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-08-22 17:07:35,735 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-08-22 17:07:35,956 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-08-22 17:07:36,155 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-08-22 17:07:36,361 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-08-22 17:07:36,729 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-08-22 17:07:37,835 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-08-22 17:07:38,098 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-08-22 17:07:38,753 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:40,767 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-08-22 17:07:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:43,629 INFO L93 Difference]: Finished difference Result 8508 states and 11131 transitions. [2020-08-22 17:07:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 17:07:43,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-08-22 17:07:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:43,663 INFO L225 Difference]: With dead ends: 8508 [2020-08-22 17:07:43,664 INFO L226 Difference]: Without dead ends: 5288 [2020-08-22 17:07:43,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-08-22 17:07:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2020-08-22 17:07:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4467. [2020-08-22 17:07:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2020-08-22 17:07:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5816 transitions. [2020-08-22 17:07:44,696 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5816 transitions. Word has length 148 [2020-08-22 17:07:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:44,697 INFO L479 AbstractCegarLoop]: Abstraction has 4467 states and 5816 transitions. [2020-08-22 17:07:44,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 17:07:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5816 transitions. [2020-08-22 17:07:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-08-22 17:07:44,703 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:44,703 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-08-22 17:07:44,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-08-22 17:07:44,704 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash -314853532, now seen corresponding path program 1 times [2020-08-22 17:07:44,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:44,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524076727] [2020-08-22 17:07:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:44,973 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:44,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:44,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:44,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:07:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:07:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:07:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:07:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 17:07:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:07:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:07:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:07:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-08-22 17:07:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-08-22 17:07:45,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524076727] [2020-08-22 17:07:45,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:07:45,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-08-22 17:07:45,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254261972] [2020-08-22 17:07:45,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 17:07:45,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 17:07:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:07:45,472 INFO L87 Difference]: Start difference. First operand 4467 states and 5816 transitions. Second operand 18 states. [2020-08-22 17:07:45,798 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:46,075 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-08-22 17:07:48,214 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-08-22 17:07:48,482 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-08-22 17:07:48,698 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-08-22 17:07:50,308 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-08-22 17:07:50,498 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-08-22 17:07:50,705 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-08-22 17:07:50,909 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-08-22 17:07:51,122 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-08-22 17:07:51,326 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-08-22 17:07:54,136 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:57,972 INFO L93 Difference]: Finished difference Result 7719 states and 10180 transitions. [2020-08-22 17:07:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-22 17:07:57,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2020-08-22 17:07:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:58,005 INFO L225 Difference]: With dead ends: 7719 [2020-08-22 17:07:58,005 INFO L226 Difference]: Without dead ends: 4611 [2020-08-22 17:07:58,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2020-08-22 17:07:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2020-08-22 17:07:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4217. [2020-08-22 17:07:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4217 states. [2020-08-22 17:07:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 4217 states and 5474 transitions. [2020-08-22 17:07:58,466 INFO L78 Accepts]: Start accepts. Automaton has 4217 states and 5474 transitions. Word has length 149 [2020-08-22 17:07:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:58,466 INFO L479 AbstractCegarLoop]: Abstraction has 4217 states and 5474 transitions. [2020-08-22 17:07:58,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 17:07:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4217 states and 5474 transitions. [2020-08-22 17:07:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 17:07:58,469 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:58,470 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-08-22 17:07:58,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-08-22 17:07:58,470 INFO L427 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 712531577, now seen corresponding path program 1 times [2020-08-22 17:07:58,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:58,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485806700] [2020-08-22 17:07:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:07:58,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:07:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:07:58,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:07:58,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 17:07:58,789 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 17:07:58,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-08-22 17:07:59,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 05:07:59 BoogieIcfgContainer [2020-08-22 17:07:59,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 17:07:59,074 INFO L168 Benchmark]: Toolchain (without parser) took 145162.35 ms. Allocated memory was 140.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 101.2 MB in the beginning and 103.4 MB in the end (delta: -2.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-08-22 17:07:59,075 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 17:07:59,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.41 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 177.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:59,077 INFO L168 Benchmark]: Boogie Preprocessor took 85.29 ms. Allocated memory is still 205.0 MB. Free memory was 177.8 MB in the beginning and 174.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:59,077 INFO L168 Benchmark]: RCFGBuilder took 1306.36 ms. Allocated memory is still 205.0 MB. Free memory was 174.5 MB in the beginning and 110.8 MB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:59,078 INFO L168 Benchmark]: TraceAbstraction took 143068.51 ms. Allocated memory was 205.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 110.8 MB in the beginning and 103.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2020-08-22 17:07:59,081 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 696.41 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 177.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.29 ms. Allocated memory is still 205.0 MB. Free memory was 177.8 MB in the beginning and 174.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1306.36 ms. Allocated memory is still 205.0 MB. Free memory was 174.5 MB in the beginning and 110.8 MB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 143068.51 ms. Allocated memory was 205.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 110.8 MB in the beginning and 103.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 664]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L105] static _Bool side1Failed_History_0 ; [L106] static _Bool side1Failed_History_1 ; [L107] static _Bool side1Failed_History_2 ; [L108] static _Bool side2Failed_History_0 ; [L109] static _Bool side2Failed_History_1 ; [L110] static _Bool side2Failed_History_2 ; [L111] static int8_t active_side_History_0 ; [L112] static int8_t active_side_History_1 ; [L113] static int8_t active_side_History_2 ; [L114] static msg_t manual_selection_History_0 ; [L115] static msg_t manual_selection_History_1 ; [L116] static msg_t manual_selection_History_2 ; [L466] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [\old(active_side_History_0)=43, \old(active_side_History_1)=31, \old(active_side_History_2)=19, \old(cs1)=25, \old(cs1_new)=16, \old(cs1_old)=37, \old(cs2)=40, \old(cs2_new)=15, \old(cs2_old)=33, \old(manual_selection_History_0)=39, \old(manual_selection_History_1)=28, \old(manual_selection_History_2)=22, \old(nomsg)=23, \old(s1p)=41, \old(s1p_new)=12, \old(s1p_old)=7, \old(s1s1)=8, \old(s1s1_new)=44, \old(s1s1_old)=18, \old(s1s2)=4, \old(s1s2_new)=42, \old(s1s2_old)=13, \old(s2p)=27, \old(s2p_new)=29, \old(s2p_old)=24, \old(s2s1)=32, \old(s2s1_new)=20, \old(s2s1_old)=38, \old(s2s2)=21, \old(s2s2_new)=36, \old(s2s2_old)=45, \old(side1_written)=11, \old(side1Failed)=9, \old(side1Failed_History_0)=35, \old(side1Failed_History_1)=46, \old(side1Failed_History_2)=10, \old(side2_written)=5, \old(side2Failed)=34, \old(side2Failed_History_0)=6, \old(side2Failed_History_1)=14, \old(side2Failed_History_2)=30, active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L588] int c1 ; [L589] int i2 ; [L592] c1 = 0 [L593] side1Failed = __VERIFIER_nondet_bool() [L594] side2Failed = __VERIFIER_nondet_bool() [L595] side1_written = __VERIFIER_nondet_char() [L596] side2_written = __VERIFIER_nondet_char() [L597] side1Failed_History_0 = __VERIFIER_nondet_bool() [L598] side1Failed_History_1 = __VERIFIER_nondet_bool() [L599] side1Failed_History_2 = __VERIFIER_nondet_bool() [L600] side2Failed_History_0 = __VERIFIER_nondet_bool() [L601] side2Failed_History_1 = __VERIFIER_nondet_bool() [L602] side2Failed_History_2 = __VERIFIER_nondet_bool() [L603] active_side_History_0 = __VERIFIER_nondet_char() [L604] active_side_History_1 = __VERIFIER_nondet_char() [L605] active_side_History_2 = __VERIFIER_nondet_char() [L606] manual_selection_History_0 = __VERIFIER_nondet_char() [L607] manual_selection_History_1 = __VERIFIER_nondet_char() [L608] manual_selection_History_2 = __VERIFIER_nondet_char() [L609] CALL, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L242] COND FALSE !((int )side1Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L245] COND FALSE !((int )side2Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L248] COND FALSE !((int )active_side_History_0 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L251] COND FALSE !((int )manual_selection_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L254] COND FALSE !((int )side1Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L257] COND FALSE !((int )side2Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L260] COND FALSE !((int )active_side_History_1 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L263] COND FALSE !((int )manual_selection_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] COND FALSE !((int )side1Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L269] COND FALSE !((int )side2Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L272] COND FALSE !((int )active_side_History_2 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L275] COND FALSE !((int )manual_selection_History_2 != 0) [L278] return (1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] RET, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, init()=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] i2 = init() [L610] CALL assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L610] RET assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] cs1_old = nomsg [L612] cs1_new = nomsg [L613] cs2_old = nomsg [L614] cs2_new = nomsg [L615] s1s2_old = nomsg [L616] s1s2_new = nomsg [L617] s1s1_old = nomsg [L618] s1s1_new = nomsg [L619] s2s1_old = nomsg [L620] s2s1_new = nomsg [L621] s2s2_old = nomsg [L622] s2s2_new = nomsg [L623] s1p_old = nomsg [L624] s1p_new = nomsg [L625] s2p_old = nomsg [L626] s2p_new = nomsg [L627] i2 = 0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L628] COND TRUE 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] CALL Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L296] msg_t manual_selection ; [L297] char tmp ; [L300] tmp = __VERIFIER_nondet_char() [L301] manual_selection = tmp VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L302] CALL write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] manual_selection_History_2 = manual_selection_History_1 [L213] manual_selection_History_1 = manual_selection_History_0 [L214] manual_selection_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L302] RET write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L303] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L303] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L304] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L304] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L305] manual_selection = (msg_t )0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L630] RET Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] CALL Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L311] int8_t side1 ; [L312] int8_t side2 ; [L313] msg_t manual_selection ; [L314] int8_t next_state ; [L317] side1 = nomsg [L318] side2 = nomsg [L319] manual_selection = (msg_t )0 [L320] side1Failed = __VERIFIER_nondet_bool() [L321] CALL write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L122] side1Failed_History_2 = side1Failed_History_1 [L123] side1Failed_History_1 = side1Failed_History_0 [L124] side1Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L321] RET write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] COND FALSE !(\read(side1Failed)) [L329] side1 = s1s1_old [L330] s1s1_old = nomsg [L331] side2 = s2s1_old [L332] s2s1_old = nomsg [L333] manual_selection = cs1_old [L334] cs1_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] COND TRUE (int )side1 == (int )side2 [L336] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L360] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L360] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L361] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L362] side1_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] RET Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] CALL Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L368] int8_t side1 ; [L369] int8_t side2 ; [L370] msg_t manual_selection ; [L371] int8_t next_state ; [L374] side1 = nomsg [L375] side2 = nomsg [L376] manual_selection = (msg_t )0 [L377] side2Failed = __VERIFIER_nondet_bool() [L378] CALL write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L152] side2Failed_History_2 = side2Failed_History_1 [L153] side2Failed_History_1 = side2Failed_History_0 [L154] side2Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L378] RET write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L379] COND FALSE !(\read(side2Failed)) [L386] side1 = s1s2_old [L387] s1s2_old = nomsg [L388] side2 = s2s2_old [L389] s2s2_old = nomsg [L390] manual_selection = cs2_old [L391] cs2_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L392] COND TRUE (int )side1 == (int )side2 [L393] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L416] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L416] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L417] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L417] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L418] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L418] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L419] side2_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \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] [L632] RET Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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] [L633] CALL Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L425] int8_t active_side ; [L426] int8_t tmp ; [L427] int8_t side1 ; [L428] int8_t side2 ; VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L431] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L193] COND TRUE (int )index == 0 [L194] return (active_side_History_0); VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L431] RET, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L431] tmp = read_active_side_history((unsigned char)0) [L432] active_side = tmp [L433] side1 = nomsg [L434] side2 = nomsg [L435] side1 = s1p_old [L436] s1p_old = nomsg [L437] side2 = s2p_old [L438] s2p_old = nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L439] COND FALSE !((int )side1 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L442] COND FALSE !((int )side2 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L445] COND FALSE !((int )side1 == 0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L453] COND TRUE (int )side1 == (int )nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L454] COND FALSE !((int )side2 == 0) [L457] active_side = (int8_t )0 VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L462] CALL write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L182] active_side_History_2 = active_side_History_1 [L183] active_side_History_1 = active_side_History_0 [L184] active_side_History_0 = val VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L462] RET write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L633] RET Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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] [L634] cs1_old = cs1_new [L635] cs1_new = nomsg [L636] cs2_old = cs2_new [L637] cs2_new = nomsg [L638] s1s2_old = s1s2_new [L639] s1s2_new = nomsg [L640] s1s1_old = s1s1_new [L641] s1s1_new = nomsg [L642] s2s1_old = s2s1_new [L643] s2s1_new = nomsg [L644] s2s2_old = s2s2_new [L645] s2s2_new = nomsg [L646] s1p_old = s1p_new [L647] s1p_new = nomsg [L648] s2p_old = s2p_new [L649] s2p_new = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-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] [L650] CALL, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L469] int tmp ; [L470] msg_t tmp___0 ; [L471] _Bool tmp___1 ; [L472] _Bool tmp___2 ; [L473] _Bool tmp___3 ; [L474] _Bool tmp___4 ; [L475] int8_t tmp___5 ; [L476] _Bool tmp___6 ; [L477] _Bool tmp___7 ; [L478] _Bool tmp___8 ; [L479] int8_t tmp___9 ; [L480] _Bool tmp___10 ; [L481] _Bool tmp___11 ; [L482] _Bool tmp___12 ; [L483] msg_t tmp___13 ; [L484] _Bool tmp___14 ; [L485] _Bool tmp___15 ; [L486] _Bool tmp___16 ; [L487] _Bool tmp___17 ; [L488] int8_t tmp___18 ; [L489] int8_t tmp___19 ; [L490] int8_t tmp___20 ; VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L493] COND TRUE ! side1Failed [L494] tmp = 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L501] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-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] [L501] RET assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L502] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L223] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L226] COND TRUE (int )index == 1 [L227] return (manual_selection_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L502] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L502] tmp___0 = read_manual_selection_history((unsigned char)1) [L503] COND TRUE ! tmp___0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L504] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L133] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L136] COND TRUE (int )index == 1 [L137] return (side1Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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_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] [L504] tmp___1 = read_side1_failed_history((unsigned char)1) [L505] COND TRUE ! tmp___1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L506] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L133] COND TRUE (int )index == 0 [L134] return (side1Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L506] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L506] tmp___2 = read_side1_failed_history((unsigned char)0) [L507] COND TRUE ! tmp___2 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L508] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L163] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L166] COND TRUE (int )index == 1 [L167] return (side2Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L508] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L508] tmp___3 = read_side2_failed_history((unsigned char)1) [L509] COND TRUE ! tmp___3 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L510] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L163] COND TRUE (int )index == 0 [L164] return (side2Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L510] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L510] tmp___4 = read_side2_failed_history((unsigned char)0) [L511] COND TRUE ! tmp___4 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L512] COND FALSE !(! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L517] COND FALSE !(! (! ((int )side1_written == 0))) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L522] COND TRUE ! (! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L523] COND TRUE ! ((int )side2_written == 0) [L524] return (0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L650] RET, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, check()=0, cs1=0, cs1_new=-1, cs1_old=-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] [L650] c1 = check() [L651] CALL assert(c1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L662] COND TRUE ! arg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-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] __VERIFIER_error() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-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 20 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 142.7s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 117.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7470 SDtfs, 29154 SDslu, 3995 SDs, 0 SdLazy, 37817 SolverSat, 10897 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2016 GetRequests, 1314 SyntacticMatches, 14 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 45.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4467occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 3805 NumberOfCodeBlocks, 3805 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3626 ConstructedInterpolants, 0 QuantifiedInterpolants, 1681044 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4072 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 237/249 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...