/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:15:56,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:15:56,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:15:56,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:15:56,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:15:56,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:15:56,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:15:56,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:15:56,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:15:56,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:15:56,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:15:56,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:15:56,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:15:56,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:15:56,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:15:56,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:15:56,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:15:56,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:15:56,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:15:56,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:15:56,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:15:56,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:15:56,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:15:56,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:15:56,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:15:56,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:15:56,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:15:56,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:15:56,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:15:56,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:15:56,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:15:56,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:15:56,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:15:56,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:15:56,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:15:56,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:15:56,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:15:56,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:15:56,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:15:56,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:15:56,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:15:56,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:15:56,449 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:15:56,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:15:56,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:15:56,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:15:56,452 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:15:56,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:15:56,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:15:56,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:15:56,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:15:56,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:15:56,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:15:56,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:15:56,453 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:15:56,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:15:56,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:15:56,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:15:56,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:15:56,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:15:56,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:15:56,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:15:56,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:15:56,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:15:56,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:15:56,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:15:56,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:15:56,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:15:56,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:15:56,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:15:56,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:15:56,952 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:15:56,953 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:15:56,954 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2020-12-22 07:15:57,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9c7575c/cb5f4d1223174480a4119e4094f64ca1/FLAGefaeca628 [2020-12-22 07:15:57,778 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:15:57,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2020-12-22 07:15:57,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9c7575c/cb5f4d1223174480a4119e4094f64ca1/FLAGefaeca628 [2020-12-22 07:15:58,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9c7575c/cb5f4d1223174480a4119e4094f64ca1 [2020-12-22 07:15:58,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:15:58,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:15:58,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:15:58,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:15:58,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:15:58,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a50189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58, skipping insertion in model container [2020-12-22 07:15:58,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:15:58,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:15:58,493 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2020-12-22 07:15:58,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:15:58,516 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:15:58,671 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2020-12-22 07:15:58,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:15:58,722 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:15:58,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58 WrapperNode [2020-12-22 07:15:58,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:15:58,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:15:58,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:15:58,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:15:58,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:15:58,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:15:58,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:15:58,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:15:58,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (1/1) ... [2020-12-22 07:15:58,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:15:58,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:15:58,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:15:58,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:15:58,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (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-12-22 07:15:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:15:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:15:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:15:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:16:00,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:16:00,704 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2020-12-22 07:16:00,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:16:00 BoogieIcfgContainer [2020-12-22 07:16:00,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:16:00,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:16:00,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:16:00,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:16:00,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:15:58" (1/3) ... [2020-12-22 07:16:00,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26430e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:16:00, skipping insertion in model container [2020-12-22 07:16:00,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:15:58" (2/3) ... [2020-12-22 07:16:00,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26430e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:16:00, skipping insertion in model container [2020-12-22 07:16:00,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:16:00" (3/3) ... [2020-12-22 07:16:00,718 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2020-12-22 07:16:00,726 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:16:00,733 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-12-22 07:16:00,755 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-12-22 07:16:00,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:16:00,789 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:16:00,790 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:16:00,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:16:00,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:16:00,790 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:16:00,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:16:00,791 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:16:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2020-12-22 07:16:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-22 07:16:00,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:00,865 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] [2020-12-22 07:16:00,866 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-12-22 07:16:00,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:00,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434621903] [2020-12-22 07:16:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:01,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434621903] [2020-12-22 07:16:01,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:01,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:16:01,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554705564] [2020-12-22 07:16:01,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-22 07:16:01,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:01,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-22 07:16:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 07:16:01,154 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 2 states. [2020-12-22 07:16:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:01,251 INFO L93 Difference]: Finished difference Result 572 states and 896 transitions. [2020-12-22 07:16:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-22 07:16:01,253 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-12-22 07:16:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:01,293 INFO L225 Difference]: With dead ends: 572 [2020-12-22 07:16:01,294 INFO L226 Difference]: Without dead ends: 292 [2020-12-22 07:16:01,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 07:16:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-12-22 07:16:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2020-12-22 07:16:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-12-22 07:16:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 428 transitions. [2020-12-22 07:16:01,367 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 428 transitions. Word has length 33 [2020-12-22 07:16:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:01,368 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 428 transitions. [2020-12-22 07:16:01,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-22 07:16:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 428 transitions. [2020-12-22 07:16:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-22 07:16:01,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:01,370 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] [2020-12-22 07:16:01,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:16:01,371 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-12-22 07:16:01,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:01,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687223779] [2020-12-22 07:16:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:01,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687223779] [2020-12-22 07:16:01,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:01,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:01,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323023351] [2020-12-22 07:16:01,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:01,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:01,494 INFO L87 Difference]: Start difference. First operand 292 states and 428 transitions. Second operand 4 states. [2020-12-22 07:16:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:01,602 INFO L93 Difference]: Finished difference Result 570 states and 830 transitions. [2020-12-22 07:16:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:16:01,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-22 07:16:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:01,609 INFO L225 Difference]: With dead ends: 570 [2020-12-22 07:16:01,609 INFO L226 Difference]: Without dead ends: 292 [2020-12-22 07:16:01,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-12-22 07:16:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2020-12-22 07:16:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-12-22 07:16:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2020-12-22 07:16:01,643 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 33 [2020-12-22 07:16:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:01,643 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2020-12-22 07:16:01,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2020-12-22 07:16:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-22 07:16:01,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:01,646 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] [2020-12-22 07:16:01,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:16:01,646 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-12-22 07:16:01,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:01,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141839396] [2020-12-22 07:16:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:01,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141839396] [2020-12-22 07:16:01,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:01,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:01,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886304246] [2020-12-22 07:16:01,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:01,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:01,839 INFO L87 Difference]: Start difference. First operand 292 states and 416 transitions. Second operand 3 states. [2020-12-22 07:16:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:01,924 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2020-12-22 07:16:01,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:01,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-22 07:16:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:01,928 INFO L225 Difference]: With dead ends: 600 [2020-12-22 07:16:01,928 INFO L226 Difference]: Without dead ends: 325 [2020-12-22 07:16:01,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-22 07:16:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 268. [2020-12-22 07:16:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-22 07:16:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2020-12-22 07:16:01,969 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 44 [2020-12-22 07:16:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:01,970 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2020-12-22 07:16:01,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2020-12-22 07:16:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-22 07:16:01,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:01,975 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] [2020-12-22 07:16:01,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:16:01,976 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1585020226, now seen corresponding path program 1 times [2020-12-22 07:16:01,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:01,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34555045] [2020-12-22 07:16:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:02,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34555045] [2020-12-22 07:16:02,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:02,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:02,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199293911] [2020-12-22 07:16:02,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:02,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:02,089 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand 3 states. [2020-12-22 07:16:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:02,127 INFO L93 Difference]: Finished difference Result 747 states and 1071 transitions. [2020-12-22 07:16:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:02,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-22 07:16:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:02,132 INFO L225 Difference]: With dead ends: 747 [2020-12-22 07:16:02,132 INFO L226 Difference]: Without dead ends: 496 [2020-12-22 07:16:02,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2020-12-22 07:16:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 303. [2020-12-22 07:16:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-12-22 07:16:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 432 transitions. [2020-12-22 07:16:02,149 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 432 transitions. Word has length 53 [2020-12-22 07:16:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:02,150 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 432 transitions. [2020-12-22 07:16:02,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 432 transitions. [2020-12-22 07:16:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-22 07:16:02,152 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:02,152 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] [2020-12-22 07:16:02,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:16:02,153 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1396202520, now seen corresponding path program 1 times [2020-12-22 07:16:02,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:02,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629705399] [2020-12-22 07:16:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:02,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629705399] [2020-12-22 07:16:02,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:02,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:02,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229585260] [2020-12-22 07:16:02,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:02,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:02,247 INFO L87 Difference]: Start difference. First operand 303 states and 432 transitions. Second operand 3 states. [2020-12-22 07:16:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:02,309 INFO L93 Difference]: Finished difference Result 831 states and 1196 transitions. [2020-12-22 07:16:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:02,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-22 07:16:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:02,314 INFO L225 Difference]: With dead ends: 831 [2020-12-22 07:16:02,314 INFO L226 Difference]: Without dead ends: 545 [2020-12-22 07:16:02,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-12-22 07:16:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 328. [2020-12-22 07:16:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-12-22 07:16:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 470 transitions. [2020-12-22 07:16:02,330 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 470 transitions. Word has length 54 [2020-12-22 07:16:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:02,331 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 470 transitions. [2020-12-22 07:16:02,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 470 transitions. [2020-12-22 07:16:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-22 07:16:02,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:02,333 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] [2020-12-22 07:16:02,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:16:02,333 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -716144150, now seen corresponding path program 1 times [2020-12-22 07:16:02,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:02,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480780727] [2020-12-22 07:16:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:02,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480780727] [2020-12-22 07:16:02,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:02,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:02,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267983631] [2020-12-22 07:16:02,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:16:02,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:16:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:02,434 INFO L87 Difference]: Start difference. First operand 328 states and 470 transitions. Second operand 5 states. [2020-12-22 07:16:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:02,719 INFO L93 Difference]: Finished difference Result 1020 states and 1473 transitions. [2020-12-22 07:16:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:16:02,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-22 07:16:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:02,726 INFO L225 Difference]: With dead ends: 1020 [2020-12-22 07:16:02,727 INFO L226 Difference]: Without dead ends: 709 [2020-12-22 07:16:02,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 07:16:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-12-22 07:16:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 426. [2020-12-22 07:16:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-12-22 07:16:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 607 transitions. [2020-12-22 07:16:02,754 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 607 transitions. Word has length 54 [2020-12-22 07:16:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:02,754 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 607 transitions. [2020-12-22 07:16:02,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:16:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 607 transitions. [2020-12-22 07:16:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-22 07:16:02,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:02,756 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] [2020-12-22 07:16:02,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:16:02,756 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:02,757 INFO L82 PathProgramCache]: Analyzing trace with hash 153208358, now seen corresponding path program 1 times [2020-12-22 07:16:02,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:02,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895696694] [2020-12-22 07:16:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:02,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895696694] [2020-12-22 07:16:02,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:02,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:02,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419985139] [2020-12-22 07:16:02,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:16:02,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:16:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:02,863 INFO L87 Difference]: Start difference. First operand 426 states and 607 transitions. Second operand 5 states. [2020-12-22 07:16:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:03,137 INFO L93 Difference]: Finished difference Result 1024 states and 1473 transitions. [2020-12-22 07:16:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:16:03,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-12-22 07:16:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:03,142 INFO L225 Difference]: With dead ends: 1024 [2020-12-22 07:16:03,142 INFO L226 Difference]: Without dead ends: 713 [2020-12-22 07:16:03,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 07:16:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-12-22 07:16:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 434. [2020-12-22 07:16:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-22 07:16:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2020-12-22 07:16:03,171 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 55 [2020-12-22 07:16:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:03,171 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2020-12-22 07:16:03,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:16:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2020-12-22 07:16:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-22 07:16:03,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:03,172 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] [2020-12-22 07:16:03,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:16:03,173 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash -748848364, now seen corresponding path program 1 times [2020-12-22 07:16:03,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:03,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292799390] [2020-12-22 07:16:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:03,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292799390] [2020-12-22 07:16:03,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:03,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:03,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008650954] [2020-12-22 07:16:03,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:03,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:03,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:03,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:03,273 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 4 states. [2020-12-22 07:16:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:03,528 INFO L93 Difference]: Finished difference Result 1024 states and 1465 transitions. [2020-12-22 07:16:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:03,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-22 07:16:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:03,534 INFO L225 Difference]: With dead ends: 1024 [2020-12-22 07:16:03,534 INFO L226 Difference]: Without dead ends: 713 [2020-12-22 07:16:03,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-12-22 07:16:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 434. [2020-12-22 07:16:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-22 07:16:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 611 transitions. [2020-12-22 07:16:03,568 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 611 transitions. Word has length 57 [2020-12-22 07:16:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:03,570 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 611 transitions. [2020-12-22 07:16:03,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 611 transitions. [2020-12-22 07:16:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-22 07:16:03,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:03,573 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] [2020-12-22 07:16:03,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:16:03,573 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2035065116, now seen corresponding path program 1 times [2020-12-22 07:16:03,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:03,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113469068] [2020-12-22 07:16:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:03,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113469068] [2020-12-22 07:16:03,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:03,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:03,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836757071] [2020-12-22 07:16:03,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:03,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:03,715 INFO L87 Difference]: Start difference. First operand 434 states and 611 transitions. Second operand 3 states. [2020-12-22 07:16:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:03,769 INFO L93 Difference]: Finished difference Result 872 states and 1252 transitions. [2020-12-22 07:16:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:03,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-12-22 07:16:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:03,773 INFO L225 Difference]: With dead ends: 872 [2020-12-22 07:16:03,773 INFO L226 Difference]: Without dead ends: 561 [2020-12-22 07:16:03,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-12-22 07:16:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 429. [2020-12-22 07:16:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-12-22 07:16:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 603 transitions. [2020-12-22 07:16:03,817 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 603 transitions. Word has length 58 [2020-12-22 07:16:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:03,818 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 603 transitions. [2020-12-22 07:16:03,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 603 transitions. [2020-12-22 07:16:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-22 07:16:03,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:03,820 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] [2020-12-22 07:16:03,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:16:03,820 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1833641356, now seen corresponding path program 1 times [2020-12-22 07:16:03,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:03,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981526718] [2020-12-22 07:16:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:03,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981526718] [2020-12-22 07:16:03,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:03,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:03,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128436468] [2020-12-22 07:16:03,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:03,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:03,957 INFO L87 Difference]: Start difference. First operand 429 states and 603 transitions. Second operand 3 states. [2020-12-22 07:16:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:04,047 INFO L93 Difference]: Finished difference Result 871 states and 1251 transitions. [2020-12-22 07:16:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:04,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-22 07:16:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:04,055 INFO L225 Difference]: With dead ends: 871 [2020-12-22 07:16:04,055 INFO L226 Difference]: Without dead ends: 565 [2020-12-22 07:16:04,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-12-22 07:16:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 409. [2020-12-22 07:16:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-12-22 07:16:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 571 transitions. [2020-12-22 07:16:04,081 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 571 transitions. Word has length 62 [2020-12-22 07:16:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:04,081 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 571 transitions. [2020-12-22 07:16:04,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 571 transitions. [2020-12-22 07:16:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-22 07:16:04,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:04,082 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] [2020-12-22 07:16:04,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:16:04,083 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash -532758708, now seen corresponding path program 1 times [2020-12-22 07:16:04,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:04,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854091517] [2020-12-22 07:16:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:04,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854091517] [2020-12-22 07:16:04,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:04,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:04,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080448902] [2020-12-22 07:16:04,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:04,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:04,167 INFO L87 Difference]: Start difference. First operand 409 states and 571 transitions. Second operand 3 states. [2020-12-22 07:16:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:04,267 INFO L93 Difference]: Finished difference Result 839 states and 1195 transitions. [2020-12-22 07:16:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:04,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-22 07:16:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:04,271 INFO L225 Difference]: With dead ends: 839 [2020-12-22 07:16:04,271 INFO L226 Difference]: Without dead ends: 553 [2020-12-22 07:16:04,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-12-22 07:16:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 397. [2020-12-22 07:16:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-12-22 07:16:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2020-12-22 07:16:04,299 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 66 [2020-12-22 07:16:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:04,299 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2020-12-22 07:16:04,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2020-12-22 07:16:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-22 07:16:04,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:04,303 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] [2020-12-22 07:16:04,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:16:04,304 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash 949999250, now seen corresponding path program 1 times [2020-12-22 07:16:04,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:04,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103125124] [2020-12-22 07:16:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:04,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103125124] [2020-12-22 07:16:04,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:04,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:04,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646399722] [2020-12-22 07:16:04,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:04,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:04,414 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 6 states. [2020-12-22 07:16:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:04,621 INFO L93 Difference]: Finished difference Result 1453 states and 2062 transitions. [2020-12-22 07:16:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:16:04,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-12-22 07:16:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:04,628 INFO L225 Difference]: With dead ends: 1453 [2020-12-22 07:16:04,628 INFO L226 Difference]: Without dead ends: 1179 [2020-12-22 07:16:04,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-22 07:16:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-12-22 07:16:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 418. [2020-12-22 07:16:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-22 07:16:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 577 transitions. [2020-12-22 07:16:04,672 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 577 transitions. Word has length 67 [2020-12-22 07:16:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:04,673 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 577 transitions. [2020-12-22 07:16:04,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 577 transitions. [2020-12-22 07:16:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-22 07:16:04,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:04,678 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] [2020-12-22 07:16:04,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:16:04,679 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1947699729, now seen corresponding path program 1 times [2020-12-22 07:16:04,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:04,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695914599] [2020-12-22 07:16:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:04,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695914599] [2020-12-22 07:16:04,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:04,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:04,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609104347] [2020-12-22 07:16:04,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:04,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:04,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:04,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:04,764 INFO L87 Difference]: Start difference. First operand 418 states and 577 transitions. Second operand 3 states. [2020-12-22 07:16:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:04,861 INFO L93 Difference]: Finished difference Result 856 states and 1211 transitions. [2020-12-22 07:16:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:04,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-12-22 07:16:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:04,865 INFO L225 Difference]: With dead ends: 856 [2020-12-22 07:16:04,865 INFO L226 Difference]: Without dead ends: 582 [2020-12-22 07:16:04,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-12-22 07:16:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 398. [2020-12-22 07:16:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-12-22 07:16:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 545 transitions. [2020-12-22 07:16:04,895 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 545 transitions. Word has length 69 [2020-12-22 07:16:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:04,896 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 545 transitions. [2020-12-22 07:16:04,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 545 transitions. [2020-12-22 07:16:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-22 07:16:04,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:04,897 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] [2020-12-22 07:16:04,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:16:04,898 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:04,898 INFO L82 PathProgramCache]: Analyzing trace with hash -344815767, now seen corresponding path program 1 times [2020-12-22 07:16:04,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:04,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828288522] [2020-12-22 07:16:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:04,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828288522] [2020-12-22 07:16:04,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:04,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:04,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057745907] [2020-12-22 07:16:04,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:04,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:04,963 INFO L87 Difference]: Start difference. First operand 398 states and 545 transitions. Second operand 3 states. [2020-12-22 07:16:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:05,046 INFO L93 Difference]: Finished difference Result 824 states and 1155 transitions. [2020-12-22 07:16:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:05,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-22 07:16:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:05,050 INFO L225 Difference]: With dead ends: 824 [2020-12-22 07:16:05,051 INFO L226 Difference]: Without dead ends: 570 [2020-12-22 07:16:05,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-22 07:16:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 386. [2020-12-22 07:16:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-12-22 07:16:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 527 transitions. [2020-12-22 07:16:05,082 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 527 transitions. Word has length 73 [2020-12-22 07:16:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:05,082 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 527 transitions. [2020-12-22 07:16:05,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 527 transitions. [2020-12-22 07:16:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-22 07:16:05,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:05,084 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] [2020-12-22 07:16:05,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:16:05,084 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1959055909, now seen corresponding path program 1 times [2020-12-22 07:16:05,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:05,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058232105] [2020-12-22 07:16:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:05,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058232105] [2020-12-22 07:16:05,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:05,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:05,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91336579] [2020-12-22 07:16:05,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:05,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:05,351 INFO L87 Difference]: Start difference. First operand 386 states and 527 transitions. Second operand 6 states. [2020-12-22 07:16:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:05,679 INFO L93 Difference]: Finished difference Result 1097 states and 1536 transitions. [2020-12-22 07:16:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:16:05,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-12-22 07:16:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:05,687 INFO L225 Difference]: With dead ends: 1097 [2020-12-22 07:16:05,687 INFO L226 Difference]: Without dead ends: 855 [2020-12-22 07:16:05,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-22 07:16:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2020-12-22 07:16:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 411. [2020-12-22 07:16:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-12-22 07:16:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 562 transitions. [2020-12-22 07:16:05,748 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 562 transitions. Word has length 76 [2020-12-22 07:16:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:05,749 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 562 transitions. [2020-12-22 07:16:05,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 562 transitions. [2020-12-22 07:16:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-22 07:16:05,751 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:05,751 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] [2020-12-22 07:16:05,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:16:05,752 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 317146558, now seen corresponding path program 1 times [2020-12-22 07:16:05,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:05,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275442565] [2020-12-22 07:16:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:05,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275442565] [2020-12-22 07:16:05,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:05,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 07:16:05,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760135177] [2020-12-22 07:16:05,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 07:16:05,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 07:16:05,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:16:05,964 INFO L87 Difference]: Start difference. First operand 411 states and 562 transitions. Second operand 7 states. [2020-12-22 07:16:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:06,415 INFO L93 Difference]: Finished difference Result 1425 states and 1984 transitions. [2020-12-22 07:16:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 07:16:06,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2020-12-22 07:16:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:06,421 INFO L225 Difference]: With dead ends: 1425 [2020-12-22 07:16:06,421 INFO L226 Difference]: Without dead ends: 1165 [2020-12-22 07:16:06,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:16:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-12-22 07:16:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 439. [2020-12-22 07:16:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-12-22 07:16:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 593 transitions. [2020-12-22 07:16:06,475 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 593 transitions. Word has length 76 [2020-12-22 07:16:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:06,476 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 593 transitions. [2020-12-22 07:16:06,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 07:16:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 593 transitions. [2020-12-22 07:16:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-22 07:16:06,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:06,477 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] [2020-12-22 07:16:06,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:16:06,479 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash 917353494, now seen corresponding path program 1 times [2020-12-22 07:16:06,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:06,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673456661] [2020-12-22 07:16:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:06,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673456661] [2020-12-22 07:16:06,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:06,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:06,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127952619] [2020-12-22 07:16:06,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:06,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:06,565 INFO L87 Difference]: Start difference. First operand 439 states and 593 transitions. Second operand 4 states. [2020-12-22 07:16:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:06,741 INFO L93 Difference]: Finished difference Result 1127 states and 1539 transitions. [2020-12-22 07:16:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:06,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-22 07:16:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:06,746 INFO L225 Difference]: With dead ends: 1127 [2020-12-22 07:16:06,747 INFO L226 Difference]: Without dead ends: 861 [2020-12-22 07:16:06,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-12-22 07:16:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 660. [2020-12-22 07:16:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2020-12-22 07:16:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 881 transitions. [2020-12-22 07:16:06,817 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 881 transitions. Word has length 76 [2020-12-22 07:16:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:06,818 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 881 transitions. [2020-12-22 07:16:06,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 881 transitions. [2020-12-22 07:16:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-22 07:16:06,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:06,820 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] [2020-12-22 07:16:06,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:16:06,820 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash 956639496, now seen corresponding path program 1 times [2020-12-22 07:16:06,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:06,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663030716] [2020-12-22 07:16:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:06,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663030716] [2020-12-22 07:16:06,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:06,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:06,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142774849] [2020-12-22 07:16:06,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:06,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:06,924 INFO L87 Difference]: Start difference. First operand 660 states and 881 transitions. Second operand 3 states. [2020-12-22 07:16:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:07,029 INFO L93 Difference]: Finished difference Result 1151 states and 1571 transitions. [2020-12-22 07:16:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:07,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-22 07:16:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:07,034 INFO L225 Difference]: With dead ends: 1151 [2020-12-22 07:16:07,034 INFO L226 Difference]: Without dead ends: 770 [2020-12-22 07:16:07,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-12-22 07:16:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 656. [2020-12-22 07:16:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2020-12-22 07:16:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 874 transitions. [2020-12-22 07:16:07,097 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 874 transitions. Word has length 77 [2020-12-22 07:16:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:07,097 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 874 transitions. [2020-12-22 07:16:07,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 874 transitions. [2020-12-22 07:16:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-22 07:16:07,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:07,099 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] [2020-12-22 07:16:07,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:16:07,099 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:07,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash 341178161, now seen corresponding path program 1 times [2020-12-22 07:16:07,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:07,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087574756] [2020-12-22 07:16:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:07,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087574756] [2020-12-22 07:16:07,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:07,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:07,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491966979] [2020-12-22 07:16:07,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:07,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:07,161 INFO L87 Difference]: Start difference. First operand 656 states and 874 transitions. Second operand 4 states. [2020-12-22 07:16:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:07,379 INFO L93 Difference]: Finished difference Result 1465 states and 1975 transitions. [2020-12-22 07:16:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:07,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-22 07:16:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:07,385 INFO L225 Difference]: With dead ends: 1465 [2020-12-22 07:16:07,385 INFO L226 Difference]: Without dead ends: 1074 [2020-12-22 07:16:07,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2020-12-22 07:16:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 875. [2020-12-22 07:16:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2020-12-22 07:16:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1156 transitions. [2020-12-22 07:16:07,496 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1156 transitions. Word has length 78 [2020-12-22 07:16:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:07,496 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 1156 transitions. [2020-12-22 07:16:07,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1156 transitions. [2020-12-22 07:16:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-22 07:16:07,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:07,499 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] [2020-12-22 07:16:07,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:16:07,499 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1360037685, now seen corresponding path program 1 times [2020-12-22 07:16:07,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:07,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153608652] [2020-12-22 07:16:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:07,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153608652] [2020-12-22 07:16:07,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:07,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:07,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084595938] [2020-12-22 07:16:07,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:07,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:07,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:07,642 INFO L87 Difference]: Start difference. First operand 875 states and 1156 transitions. Second operand 6 states. [2020-12-22 07:16:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:08,274 INFO L93 Difference]: Finished difference Result 3252 states and 4369 transitions. [2020-12-22 07:16:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 07:16:08,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-12-22 07:16:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:08,288 INFO L225 Difference]: With dead ends: 3252 [2020-12-22 07:16:08,288 INFO L226 Difference]: Without dead ends: 2730 [2020-12-22 07:16:08,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:16:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2020-12-22 07:16:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1001. [2020-12-22 07:16:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2020-12-22 07:16:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1303 transitions. [2020-12-22 07:16:08,417 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1303 transitions. Word has length 78 [2020-12-22 07:16:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:08,417 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1303 transitions. [2020-12-22 07:16:08,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1303 transitions. [2020-12-22 07:16:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-22 07:16:08,420 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:08,420 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] [2020-12-22 07:16:08,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:16:08,420 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:08,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:08,421 INFO L82 PathProgramCache]: Analyzing trace with hash -504696615, now seen corresponding path program 1 times [2020-12-22 07:16:08,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:08,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157167819] [2020-12-22 07:16:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:08,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157167819] [2020-12-22 07:16:08,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:08,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:08,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543637024] [2020-12-22 07:16:08,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:08,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:08,506 INFO L87 Difference]: Start difference. First operand 1001 states and 1303 transitions. Second operand 4 states. [2020-12-22 07:16:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:08,786 INFO L93 Difference]: Finished difference Result 2405 states and 3178 transitions. [2020-12-22 07:16:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:08,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-22 07:16:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:08,795 INFO L225 Difference]: With dead ends: 2405 [2020-12-22 07:16:08,795 INFO L226 Difference]: Without dead ends: 1835 [2020-12-22 07:16:08,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2020-12-22 07:16:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1356. [2020-12-22 07:16:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2020-12-22 07:16:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1760 transitions. [2020-12-22 07:16:08,938 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1760 transitions. Word has length 79 [2020-12-22 07:16:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:08,938 INFO L481 AbstractCegarLoop]: Abstraction has 1356 states and 1760 transitions. [2020-12-22 07:16:08,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1760 transitions. [2020-12-22 07:16:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-22 07:16:08,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:08,940 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] [2020-12-22 07:16:08,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:16:08,941 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -676572605, now seen corresponding path program 1 times [2020-12-22 07:16:08,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:08,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507939942] [2020-12-22 07:16:08,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:08,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507939942] [2020-12-22 07:16:08,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:08,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:08,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388579185] [2020-12-22 07:16:08,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:08,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:08,977 INFO L87 Difference]: Start difference. First operand 1356 states and 1760 transitions. Second operand 3 states. [2020-12-22 07:16:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:09,318 INFO L93 Difference]: Finished difference Result 3202 states and 4179 transitions. [2020-12-22 07:16:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:09,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-22 07:16:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:09,329 INFO L225 Difference]: With dead ends: 3202 [2020-12-22 07:16:09,329 INFO L226 Difference]: Without dead ends: 2224 [2020-12-22 07:16:09,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2020-12-22 07:16:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1358. [2020-12-22 07:16:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2020-12-22 07:16:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1762 transitions. [2020-12-22 07:16:09,478 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1762 transitions. Word has length 80 [2020-12-22 07:16:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:09,479 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1762 transitions. [2020-12-22 07:16:09,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1762 transitions. [2020-12-22 07:16:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 07:16:09,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:09,481 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] [2020-12-22 07:16:09,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 07:16:09,481 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:09,482 INFO L82 PathProgramCache]: Analyzing trace with hash 614216993, now seen corresponding path program 1 times [2020-12-22 07:16:09,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:09,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896984077] [2020-12-22 07:16:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:09,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896984077] [2020-12-22 07:16:09,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:09,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:09,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715392269] [2020-12-22 07:16:09,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:09,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:09,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:09,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:09,584 INFO L87 Difference]: Start difference. First operand 1358 states and 1762 transitions. Second operand 6 states. [2020-12-22 07:16:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:09,956 INFO L93 Difference]: Finished difference Result 2145 states and 2828 transitions. [2020-12-22 07:16:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:16:09,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2020-12-22 07:16:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:09,967 INFO L225 Difference]: With dead ends: 2145 [2020-12-22 07:16:09,968 INFO L226 Difference]: Without dead ends: 2143 [2020-12-22 07:16:09,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 07:16:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2020-12-22 07:16:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1360. [2020-12-22 07:16:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2020-12-22 07:16:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1764 transitions. [2020-12-22 07:16:10,140 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1764 transitions. Word has length 81 [2020-12-22 07:16:10,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:10,140 INFO L481 AbstractCegarLoop]: Abstraction has 1360 states and 1764 transitions. [2020-12-22 07:16:10,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1764 transitions. [2020-12-22 07:16:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 07:16:10,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:10,143 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] [2020-12-22 07:16:10,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:16:10,143 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1500088230, now seen corresponding path program 1 times [2020-12-22 07:16:10,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:10,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366442364] [2020-12-22 07:16:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:10,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366442364] [2020-12-22 07:16:10,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:10,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:10,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133939136] [2020-12-22 07:16:10,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:10,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:10,320 INFO L87 Difference]: Start difference. First operand 1360 states and 1764 transitions. Second operand 6 states. [2020-12-22 07:16:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:10,818 INFO L93 Difference]: Finished difference Result 3228 states and 4330 transitions. [2020-12-22 07:16:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:16:10,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2020-12-22 07:16:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:10,830 INFO L225 Difference]: With dead ends: 3228 [2020-12-22 07:16:10,831 INFO L226 Difference]: Without dead ends: 2410 [2020-12-22 07:16:10,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-22 07:16:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-12-22 07:16:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 1360. [2020-12-22 07:16:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2020-12-22 07:16:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1752 transitions. [2020-12-22 07:16:10,995 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1752 transitions. Word has length 81 [2020-12-22 07:16:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:10,995 INFO L481 AbstractCegarLoop]: Abstraction has 1360 states and 1752 transitions. [2020-12-22 07:16:10,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1752 transitions. [2020-12-22 07:16:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 07:16:10,997 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:10,998 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] [2020-12-22 07:16:10,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 07:16:10,998 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash -659983772, now seen corresponding path program 1 times [2020-12-22 07:16:10,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:10,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635370052] [2020-12-22 07:16:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:11,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635370052] [2020-12-22 07:16:11,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:11,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:11,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922254338] [2020-12-22 07:16:11,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:11,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:11,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:11,076 INFO L87 Difference]: Start difference. First operand 1360 states and 1752 transitions. Second operand 4 states. [2020-12-22 07:16:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:11,321 INFO L93 Difference]: Finished difference Result 2706 states and 3519 transitions. [2020-12-22 07:16:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:11,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-22 07:16:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:11,342 INFO L225 Difference]: With dead ends: 2706 [2020-12-22 07:16:11,343 INFO L226 Difference]: Without dead ends: 1422 [2020-12-22 07:16:11,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-12-22 07:16:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1060. [2020-12-22 07:16:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2020-12-22 07:16:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1384 transitions. [2020-12-22 07:16:11,547 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1384 transitions. Word has length 81 [2020-12-22 07:16:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:11,547 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1384 transitions. [2020-12-22 07:16:11,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1384 transitions. [2020-12-22 07:16:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-22 07:16:11,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:11,549 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-12-22 07:16:11,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:16:11,550 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash -63459148, now seen corresponding path program 1 times [2020-12-22 07:16:11,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:11,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337249434] [2020-12-22 07:16:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:11,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337249434] [2020-12-22 07:16:11,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:11,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:16:11,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017872460] [2020-12-22 07:16:11,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:16:11,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:16:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:11,602 INFO L87 Difference]: Start difference. First operand 1060 states and 1384 transitions. Second operand 3 states. [2020-12-22 07:16:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:11,924 INFO L93 Difference]: Finished difference Result 2504 states and 3290 transitions. [2020-12-22 07:16:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:16:11,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-22 07:16:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:11,938 INFO L225 Difference]: With dead ends: 2504 [2020-12-22 07:16:11,938 INFO L226 Difference]: Without dead ends: 1594 [2020-12-22 07:16:11,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:16:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2020-12-22 07:16:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1066. [2020-12-22 07:16:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2020-12-22 07:16:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1390 transitions. [2020-12-22 07:16:12,087 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1390 transitions. Word has length 82 [2020-12-22 07:16:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:12,087 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1390 transitions. [2020-12-22 07:16:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:16:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1390 transitions. [2020-12-22 07:16:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-22 07:16:12,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:12,089 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-12-22 07:16:12,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 07:16:12,090 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash -753963456, now seen corresponding path program 1 times [2020-12-22 07:16:12,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:12,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918980515] [2020-12-22 07:16:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:12,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918980515] [2020-12-22 07:16:12,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:12,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:12,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852343136] [2020-12-22 07:16:12,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:12,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:12,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:12,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:12,202 INFO L87 Difference]: Start difference. First operand 1066 states and 1390 transitions. Second operand 4 states. [2020-12-22 07:16:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:12,425 INFO L93 Difference]: Finished difference Result 2448 states and 3210 transitions. [2020-12-22 07:16:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:12,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2020-12-22 07:16:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:12,429 INFO L225 Difference]: With dead ends: 2448 [2020-12-22 07:16:12,430 INFO L226 Difference]: Without dead ends: 1482 [2020-12-22 07:16:12,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-12-22 07:16:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1006. [2020-12-22 07:16:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2020-12-22 07:16:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1308 transitions. [2020-12-22 07:16:12,559 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1308 transitions. Word has length 82 [2020-12-22 07:16:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:12,560 INFO L481 AbstractCegarLoop]: Abstraction has 1006 states and 1308 transitions. [2020-12-22 07:16:12,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1308 transitions. [2020-12-22 07:16:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-22 07:16:12,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:12,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:12,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 07:16:12,562 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -883855950, now seen corresponding path program 1 times [2020-12-22 07:16:12,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:12,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857934964] [2020-12-22 07:16:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:12,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857934964] [2020-12-22 07:16:12,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:12,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:12,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870473570] [2020-12-22 07:16:12,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:12,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:12,736 INFO L87 Difference]: Start difference. First operand 1006 states and 1308 transitions. Second operand 6 states. [2020-12-22 07:16:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:13,418 INFO L93 Difference]: Finished difference Result 3321 states and 4518 transitions. [2020-12-22 07:16:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:16:13,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2020-12-22 07:16:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:13,425 INFO L225 Difference]: With dead ends: 3321 [2020-12-22 07:16:13,425 INFO L226 Difference]: Without dead ends: 2514 [2020-12-22 07:16:13,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-22 07:16:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2020-12-22 07:16:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 994. [2020-12-22 07:16:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2020-12-22 07:16:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1296 transitions. [2020-12-22 07:16:13,586 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1296 transitions. Word has length 84 [2020-12-22 07:16:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:13,587 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1296 transitions. [2020-12-22 07:16:13,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1296 transitions. [2020-12-22 07:16:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-22 07:16:13,588 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:13,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:13,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 07:16:13,589 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1751255189, now seen corresponding path program 1 times [2020-12-22 07:16:13,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:13,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732952632] [2020-12-22 07:16:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:13,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732952632] [2020-12-22 07:16:13,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:13,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:16:13,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402422887] [2020-12-22 07:16:13,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:13,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:13,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:16:13,678 INFO L87 Difference]: Start difference. First operand 994 states and 1296 transitions. Second operand 6 states. [2020-12-22 07:16:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:14,040 INFO L93 Difference]: Finished difference Result 2388 states and 3264 transitions. [2020-12-22 07:16:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 07:16:14,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2020-12-22 07:16:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:14,044 INFO L225 Difference]: With dead ends: 2388 [2020-12-22 07:16:14,044 INFO L226 Difference]: Without dead ends: 1581 [2020-12-22 07:16:14,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 07:16:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2020-12-22 07:16:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1000. [2020-12-22 07:16:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2020-12-22 07:16:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1302 transitions. [2020-12-22 07:16:14,189 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1302 transitions. Word has length 85 [2020-12-22 07:16:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:14,190 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1302 transitions. [2020-12-22 07:16:14,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1302 transitions. [2020-12-22 07:16:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-22 07:16:14,194 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:14,195 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:14,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 07:16:14,195 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2138552324, now seen corresponding path program 1 times [2020-12-22 07:16:14,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:14,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310465006] [2020-12-22 07:16:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:14,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310465006] [2020-12-22 07:16:14,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160529434] [2020-12-22 07:16:14,416 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-12-22 07:16:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:14,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-22 07:16:14,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:16:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:16:14,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:16:14,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2020-12-22 07:16:14,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204920645] [2020-12-22 07:16:14,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:14,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:14,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-12-22 07:16:14,927 INFO L87 Difference]: Start difference. First operand 1000 states and 1302 transitions. Second operand 6 states. [2020-12-22 07:16:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:15,423 INFO L93 Difference]: Finished difference Result 2593 states and 3515 transitions. [2020-12-22 07:16:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 07:16:15,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2020-12-22 07:16:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:15,428 INFO L225 Difference]: With dead ends: 2593 [2020-12-22 07:16:15,428 INFO L226 Difference]: Without dead ends: 1780 [2020-12-22 07:16:15,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-12-22 07:16:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2020-12-22 07:16:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1000. [2020-12-22 07:16:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2020-12-22 07:16:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1301 transitions. [2020-12-22 07:16:15,610 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1301 transitions. Word has length 134 [2020-12-22 07:16:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:15,610 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1301 transitions. [2020-12-22 07:16:15,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1301 transitions. [2020-12-22 07:16:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-22 07:16:15,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:15,614 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:15,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:15,829 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash -687074335, now seen corresponding path program 1 times [2020-12-22 07:16:15,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:15,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732278710] [2020-12-22 07:16:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:16,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732278710] [2020-12-22 07:16:16,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116247747] [2020-12-22 07:16:16,062 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-12-22 07:16:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:16,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 07:16:16,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:16:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:16,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:16:16,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-12-22 07:16:16,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077462570] [2020-12-22 07:16:16,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 07:16:16,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 07:16:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:16:16,626 INFO L87 Difference]: Start difference. First operand 1000 states and 1301 transitions. Second operand 13 states. [2020-12-22 07:16:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:32,384 INFO L93 Difference]: Finished difference Result 16786 states and 22436 transitions. [2020-12-22 07:16:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2020-12-22 07:16:32,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2020-12-22 07:16:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:32,422 INFO L225 Difference]: With dead ends: 16786 [2020-12-22 07:16:32,422 INFO L226 Difference]: Without dead ends: 15979 [2020-12-22 07:16:32,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28995 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=8289, Invalid=55467, Unknown=0, NotChecked=0, Total=63756 [2020-12-22 07:16:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15979 states. [2020-12-22 07:16:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15979 to 2718. [2020-12-22 07:16:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2020-12-22 07:16:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3545 transitions. [2020-12-22 07:16:33,005 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3545 transitions. Word has length 138 [2020-12-22 07:16:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:33,005 INFO L481 AbstractCegarLoop]: Abstraction has 2718 states and 3545 transitions. [2020-12-22 07:16:33,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 07:16:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3545 transitions. [2020-12-22 07:16:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-22 07:16:33,021 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:33,021 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:33,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:33,236 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1319221063, now seen corresponding path program 1 times [2020-12-22 07:16:33,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:33,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575065478] [2020-12-22 07:16:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:33,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575065478] [2020-12-22 07:16:33,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881266940] [2020-12-22 07:16:33,562 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-12-22 07:16:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:33,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-22 07:16:33,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:16:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:16:34,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:16:34,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2020-12-22 07:16:34,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100631120] [2020-12-22 07:16:34,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:16:34,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:16:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:16:34,075 INFO L87 Difference]: Start difference. First operand 2718 states and 3545 transitions. Second operand 6 states. [2020-12-22 07:16:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:35,335 INFO L93 Difference]: Finished difference Result 7282 states and 9888 transitions. [2020-12-22 07:16:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:16:35,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2020-12-22 07:16:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:35,346 INFO L225 Difference]: With dead ends: 7282 [2020-12-22 07:16:35,346 INFO L226 Difference]: Without dead ends: 4791 [2020-12-22 07:16:35,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-12-22 07:16:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2020-12-22 07:16:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 2375. [2020-12-22 07:16:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2020-12-22 07:16:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3104 transitions. [2020-12-22 07:16:35,742 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3104 transitions. Word has length 139 [2020-12-22 07:16:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:35,742 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 3104 transitions. [2020-12-22 07:16:35,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:16:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3104 transitions. [2020-12-22 07:16:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-22 07:16:35,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:35,748 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:35,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:35,964 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -954398025, now seen corresponding path program 1 times [2020-12-22 07:16:35,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:35,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087727126] [2020-12-22 07:16:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 07:16:36,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087727126] [2020-12-22 07:16:36,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:36,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 07:16:36,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788183672] [2020-12-22 07:16:36,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 07:16:36,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 07:16:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:16:36,130 INFO L87 Difference]: Start difference. First operand 2375 states and 3104 transitions. Second operand 7 states. [2020-12-22 07:16:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:38,779 INFO L93 Difference]: Finished difference Result 14087 states and 18950 transitions. [2020-12-22 07:16:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 07:16:38,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-12-22 07:16:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:38,811 INFO L225 Difference]: With dead ends: 14087 [2020-12-22 07:16:38,811 INFO L226 Difference]: Without dead ends: 11979 [2020-12-22 07:16:38,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-12-22 07:16:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11979 states. [2020-12-22 07:16:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11979 to 2831. [2020-12-22 07:16:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-22 07:16:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3634 transitions. [2020-12-22 07:16:39,546 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3634 transitions. Word has length 140 [2020-12-22 07:16:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:39,546 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 3634 transitions. [2020-12-22 07:16:39,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 07:16:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3634 transitions. [2020-12-22 07:16:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-22 07:16:39,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:39,553 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:39,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 07:16:39,554 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash -186871780, now seen corresponding path program 1 times [2020-12-22 07:16:39,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:39,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619903026] [2020-12-22 07:16:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:39,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619903026] [2020-12-22 07:16:39,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372581087] [2020-12-22 07:16:39,783 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-12-22 07:16:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-22 07:16:40,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:16:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-22 07:16:40,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:16:40,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2020-12-22 07:16:40,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407829779] [2020-12-22 07:16:40,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 07:16:40,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:40,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 07:16:40,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-12-22 07:16:40,211 INFO L87 Difference]: Start difference. First operand 2831 states and 3634 transitions. Second operand 11 states. [2020-12-22 07:16:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:43,214 INFO L93 Difference]: Finished difference Result 8074 states and 10544 transitions. [2020-12-22 07:16:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-22 07:16:43,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2020-12-22 07:16:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:43,224 INFO L225 Difference]: With dead ends: 8074 [2020-12-22 07:16:43,224 INFO L226 Difference]: Without dead ends: 5307 [2020-12-22 07:16:43,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2020-12-22 07:16:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2020-12-22 07:16:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 2352. [2020-12-22 07:16:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2020-12-22 07:16:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3021 transitions. [2020-12-22 07:16:43,761 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3021 transitions. Word has length 142 [2020-12-22 07:16:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:43,761 INFO L481 AbstractCegarLoop]: Abstraction has 2352 states and 3021 transitions. [2020-12-22 07:16:43,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 07:16:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3021 transitions. [2020-12-22 07:16:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-22 07:16:43,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:43,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:43,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:43,980 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1061111299, now seen corresponding path program 1 times [2020-12-22 07:16:43,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:43,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522658563] [2020-12-22 07:16:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:44,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522658563] [2020-12-22 07:16:44,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903135821] [2020-12-22 07:16:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:44,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-22 07:16:44,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:16:44,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 07:16:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:44,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:16:44,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-12-22 07:16:44,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315211822] [2020-12-22 07:16:44,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-22 07:16:44,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-22 07:16:44,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-22 07:16:44,870 INFO L87 Difference]: Start difference. First operand 2352 states and 3021 transitions. Second operand 18 states. [2020-12-22 07:16:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:47,313 INFO L93 Difference]: Finished difference Result 6478 states and 8354 transitions. [2020-12-22 07:16:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 07:16:47,313 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2020-12-22 07:16:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:47,318 INFO L225 Difference]: With dead ends: 6478 [2020-12-22 07:16:47,319 INFO L226 Difference]: Without dead ends: 4341 [2020-12-22 07:16:47,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2020-12-22 07:16:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2020-12-22 07:16:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 2609. [2020-12-22 07:16:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2020-12-22 07:16:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3344 transitions. [2020-12-22 07:16:47,864 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3344 transitions. Word has length 142 [2020-12-22 07:16:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:47,864 INFO L481 AbstractCegarLoop]: Abstraction has 2609 states and 3344 transitions. [2020-12-22 07:16:47,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-22 07:16:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3344 transitions. [2020-12-22 07:16:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-22 07:16:47,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:47,871 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:48,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-22 07:16:48,085 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:48,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2099695873, now seen corresponding path program 1 times [2020-12-22 07:16:48,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:48,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159218470] [2020-12-22 07:16:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-22 07:16:48,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159218470] [2020-12-22 07:16:48,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:48,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:48,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717442714] [2020-12-22 07:16:48,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:16:48,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:48,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:16:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:48,213 INFO L87 Difference]: Start difference. First operand 2609 states and 3344 transitions. Second operand 5 states. [2020-12-22 07:16:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:48,680 INFO L93 Difference]: Finished difference Result 4924 states and 6359 transitions. [2020-12-22 07:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:48,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2020-12-22 07:16:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:48,683 INFO L225 Difference]: With dead ends: 4924 [2020-12-22 07:16:48,683 INFO L226 Difference]: Without dead ends: 2469 [2020-12-22 07:16:48,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-12-22 07:16:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2469. [2020-12-22 07:16:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2020-12-22 07:16:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3167 transitions. [2020-12-22 07:16:49,314 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3167 transitions. Word has length 142 [2020-12-22 07:16:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:49,315 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 3167 transitions. [2020-12-22 07:16:49,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:16:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3167 transitions. [2020-12-22 07:16:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-22 07:16:49,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:49,321 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:49,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-22 07:16:49,321 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash 716339399, now seen corresponding path program 1 times [2020-12-22 07:16:49,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:49,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438121960] [2020-12-22 07:16:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:49,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438121960] [2020-12-22 07:16:49,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745792338] [2020-12-22 07:16:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:49,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-22 07:16:49,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:16:49,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 07:16:49,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 07:16:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:50,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:16:50,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-12-22 07:16:50,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036456855] [2020-12-22 07:16:50,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-22 07:16:50,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:50,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-22 07:16:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-22 07:16:50,341 INFO L87 Difference]: Start difference. First operand 2469 states and 3167 transitions. Second operand 18 states. [2020-12-22 07:16:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:54,378 INFO L93 Difference]: Finished difference Result 7321 states and 9394 transitions. [2020-12-22 07:16:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-22 07:16:54,379 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 143 [2020-12-22 07:16:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:54,384 INFO L225 Difference]: With dead ends: 7321 [2020-12-22 07:16:54,384 INFO L226 Difference]: Without dead ends: 5067 [2020-12-22 07:16:54,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=612, Invalid=2250, Unknown=0, NotChecked=0, Total=2862 [2020-12-22 07:16:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2020-12-22 07:16:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 2760. [2020-12-22 07:16:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2020-12-22 07:16:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3532 transitions. [2020-12-22 07:16:54,928 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3532 transitions. Word has length 143 [2020-12-22 07:16:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:54,928 INFO L481 AbstractCegarLoop]: Abstraction has 2760 states and 3532 transitions. [2020-12-22 07:16:54,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-22 07:16:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3532 transitions. [2020-12-22 07:16:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-22 07:16:54,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:54,934 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:55,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:16:55,150 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1256825979, now seen corresponding path program 1 times [2020-12-22 07:16:55,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:55,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853321291] [2020-12-22 07:16:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-22 07:16:55,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853321291] [2020-12-22 07:16:55,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:55,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:55,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487012538] [2020-12-22 07:16:55,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:16:55,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:16:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:55,217 INFO L87 Difference]: Start difference. First operand 2760 states and 3532 transitions. Second operand 4 states. [2020-12-22 07:16:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:55,897 INFO L93 Difference]: Finished difference Result 5152 states and 6636 transitions. [2020-12-22 07:16:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:16:55,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2020-12-22 07:16:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:55,901 INFO L225 Difference]: With dead ends: 5152 [2020-12-22 07:16:55,901 INFO L226 Difference]: Without dead ends: 2548 [2020-12-22 07:16:55,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:16:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2020-12-22 07:16:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2536. [2020-12-22 07:16:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2020-12-22 07:16:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3233 transitions. [2020-12-22 07:16:56,262 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3233 transitions. Word has length 143 [2020-12-22 07:16:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:56,262 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 3233 transitions. [2020-12-22 07:16:56,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:16:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3233 transitions. [2020-12-22 07:16:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-22 07:16:56,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:56,267 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:56,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-22 07:16:56,267 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2112638184, now seen corresponding path program 1 times [2020-12-22 07:16:56,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:56,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706582949] [2020-12-22 07:16:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:16:56,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706582949] [2020-12-22 07:16:56,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:56,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 07:16:56,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403267954] [2020-12-22 07:16:56,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 07:16:56,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 07:16:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-22 07:16:56,518 INFO L87 Difference]: Start difference. First operand 2536 states and 3233 transitions. Second operand 10 states. [2020-12-22 07:16:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:58,020 INFO L93 Difference]: Finished difference Result 6666 states and 8570 transitions. [2020-12-22 07:16:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 07:16:58,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2020-12-22 07:16:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:58,024 INFO L225 Difference]: With dead ends: 6666 [2020-12-22 07:16:58,025 INFO L226 Difference]: Without dead ends: 4345 [2020-12-22 07:16:58,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2020-12-22 07:16:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2020-12-22 07:16:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 2870. [2020-12-22 07:16:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2020-12-22 07:16:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3655 transitions. [2020-12-22 07:16:58,461 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 3655 transitions. Word has length 143 [2020-12-22 07:16:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:58,461 INFO L481 AbstractCegarLoop]: Abstraction has 2870 states and 3655 transitions. [2020-12-22 07:16:58,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 07:16:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 3655 transitions. [2020-12-22 07:16:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-22 07:16:58,466 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:58,466 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:58,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-22 07:16:58,467 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash 270162470, now seen corresponding path program 1 times [2020-12-22 07:16:58,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:58,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827715902] [2020-12-22 07:16:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:16:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-22 07:16:58,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827715902] [2020-12-22 07:16:58,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:16:58,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:16:58,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297718771] [2020-12-22 07:16:58,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:16:58,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:16:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:16:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:58,580 INFO L87 Difference]: Start difference. First operand 2870 states and 3655 transitions. Second operand 5 states. [2020-12-22 07:16:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:16:59,285 INFO L93 Difference]: Finished difference Result 5366 states and 6873 transitions. [2020-12-22 07:16:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:16:59,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2020-12-22 07:16:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:16:59,290 INFO L225 Difference]: With dead ends: 5366 [2020-12-22 07:16:59,290 INFO L226 Difference]: Without dead ends: 2653 [2020-12-22 07:16:59,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:16:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2020-12-22 07:16:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2653. [2020-12-22 07:16:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2020-12-22 07:16:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3382 transitions. [2020-12-22 07:16:59,739 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3382 transitions. Word has length 143 [2020-12-22 07:16:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:16:59,739 INFO L481 AbstractCegarLoop]: Abstraction has 2653 states and 3382 transitions. [2020-12-22 07:16:59,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:16:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3382 transitions. [2020-12-22 07:16:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-22 07:16:59,743 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:16:59,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:16:59,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-22 07:16:59,744 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:16:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:16:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash -954015038, now seen corresponding path program 1 times [2020-12-22 07:16:59,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:16:59,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374557882] [2020-12-22 07:16:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:16:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:00,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374557882] [2020-12-22 07:17:00,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799959405] [2020-12-22 07:17:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:00,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-22 07:17:00,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:17:00,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 07:17:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:00,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:17:00,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-12-22 07:17:00,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140880891] [2020-12-22 07:17:00,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 07:17:00,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:17:00,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 07:17:00,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-22 07:17:00,741 INFO L87 Difference]: Start difference. First operand 2653 states and 3382 transitions. Second operand 10 states. [2020-12-22 07:17:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:17:02,207 INFO L93 Difference]: Finished difference Result 7329 states and 9352 transitions. [2020-12-22 07:17:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 07:17:02,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2020-12-22 07:17:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:17:02,212 INFO L225 Difference]: With dead ends: 7329 [2020-12-22 07:17:02,212 INFO L226 Difference]: Without dead ends: 4891 [2020-12-22 07:17:02,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-12-22 07:17:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4891 states. [2020-12-22 07:17:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4891 to 2664. [2020-12-22 07:17:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2020-12-22 07:17:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3393 transitions. [2020-12-22 07:17:02,616 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3393 transitions. Word has length 144 [2020-12-22 07:17:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:17:02,616 INFO L481 AbstractCegarLoop]: Abstraction has 2664 states and 3393 transitions. [2020-12-22 07:17:02,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 07:17:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3393 transitions. [2020-12-22 07:17:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-22 07:17:02,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:17:02,619 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:17:02,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:02,821 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:17:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:17:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash 537259920, now seen corresponding path program 1 times [2020-12-22 07:17:02,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:17:02,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681671235] [2020-12-22 07:17:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:17:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:03,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681671235] [2020-12-22 07:17:03,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897208954] [2020-12-22 07:17:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:03,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-22 07:17:03,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:17:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:17:03,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:17:03,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2020-12-22 07:17:03,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929776976] [2020-12-22 07:17:03,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:17:03,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:17:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:17:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-12-22 07:17:03,469 INFO L87 Difference]: Start difference. First operand 2664 states and 3393 transitions. Second operand 6 states. [2020-12-22 07:17:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:17:04,715 INFO L93 Difference]: Finished difference Result 8700 states and 11360 transitions. [2020-12-22 07:17:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:17:04,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2020-12-22 07:17:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:17:04,721 INFO L225 Difference]: With dead ends: 8700 [2020-12-22 07:17:04,721 INFO L226 Difference]: Without dead ends: 6211 [2020-12-22 07:17:04,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-12-22 07:17:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2020-12-22 07:17:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 2664. [2020-12-22 07:17:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2020-12-22 07:17:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3391 transitions. [2020-12-22 07:17:05,185 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3391 transitions. Word has length 144 [2020-12-22 07:17:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:17:05,186 INFO L481 AbstractCegarLoop]: Abstraction has 2664 states and 3391 transitions. [2020-12-22 07:17:05,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:17:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3391 transitions. [2020-12-22 07:17:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-22 07:17:05,188 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:17:05,189 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:17:05,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-12-22 07:17:05,390 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:17:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:17:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1592761434, now seen corresponding path program 1 times [2020-12-22 07:17:05,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:17:05,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516720176] [2020-12-22 07:17:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:17:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:05,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516720176] [2020-12-22 07:17:05,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980844465] [2020-12-22 07:17:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:05,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 07:17:05,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:17:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:05,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:17:05,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2020-12-22 07:17:05,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990618136] [2020-12-22 07:17:05,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 07:17:05,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:17:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 07:17:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-22 07:17:05,965 INFO L87 Difference]: Start difference. First operand 2664 states and 3391 transitions. Second operand 8 states. [2020-12-22 07:17:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:17:07,694 INFO L93 Difference]: Finished difference Result 10232 states and 13054 transitions. [2020-12-22 07:17:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 07:17:07,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2020-12-22 07:17:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:17:07,703 INFO L225 Difference]: With dead ends: 10232 [2020-12-22 07:17:07,703 INFO L226 Difference]: Without dead ends: 7783 [2020-12-22 07:17:07,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2020-12-22 07:17:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7783 states. [2020-12-22 07:17:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7783 to 4094. [2020-12-22 07:17:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4094 states. [2020-12-22 07:17:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 5206 transitions. [2020-12-22 07:17:08,450 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 5206 transitions. Word has length 145 [2020-12-22 07:17:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:17:08,450 INFO L481 AbstractCegarLoop]: Abstraction has 4094 states and 5206 transitions. [2020-12-22 07:17:08,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 07:17:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 5206 transitions. [2020-12-22 07:17:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-22 07:17:08,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:17:08,457 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:17:08,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:08,665 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:17:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:17:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash 729040484, now seen corresponding path program 1 times [2020-12-22 07:17:08,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:17:08,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697214784] [2020-12-22 07:17:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:17:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-22 07:17:08,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697214784] [2020-12-22 07:17:08,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:17:08,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:17:08,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358753637] [2020-12-22 07:17:08,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:17:08,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:17:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:17:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:17:08,732 INFO L87 Difference]: Start difference. First operand 4094 states and 5206 transitions. Second operand 4 states. [2020-12-22 07:17:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:17:09,367 INFO L93 Difference]: Finished difference Result 7134 states and 9154 transitions. [2020-12-22 07:17:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:17:09,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-22 07:17:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:17:09,371 INFO L225 Difference]: With dead ends: 7134 [2020-12-22 07:17:09,372 INFO L226 Difference]: Without dead ends: 3255 [2020-12-22 07:17:09,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:17:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2020-12-22 07:17:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3236. [2020-12-22 07:17:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3236 states. [2020-12-22 07:17:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4113 transitions. [2020-12-22 07:17:09,869 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4113 transitions. Word has length 145 [2020-12-22 07:17:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:17:09,869 INFO L481 AbstractCegarLoop]: Abstraction has 3236 states and 4113 transitions. [2020-12-22 07:17:09,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:17:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4113 transitions. [2020-12-22 07:17:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-22 07:17:09,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:17:09,873 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:17:09,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-22 07:17:09,873 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:17:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:17:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1178275366, now seen corresponding path program 1 times [2020-12-22 07:17:09,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:17:09,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940730418] [2020-12-22 07:17:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:17:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:10,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940730418] [2020-12-22 07:17:10,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358096841] [2020-12-22 07:17:10,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:10,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 07:17:10,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:17:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:17:10,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:17:10,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2020-12-22 07:17:10,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350175068] [2020-12-22 07:17:10,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 07:17:10,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:17:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 07:17:10,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-12-22 07:17:10,655 INFO L87 Difference]: Start difference. First operand 3236 states and 4113 transitions. Second operand 15 states. [2020-12-22 07:17:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:17:23,325 INFO L93 Difference]: Finished difference Result 19096 states and 24670 transitions. [2020-12-22 07:17:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2020-12-22 07:17:23,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2020-12-22 07:17:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:17:23,340 INFO L225 Difference]: With dead ends: 19096 [2020-12-22 07:17:23,340 INFO L226 Difference]: Without dead ends: 16075 [2020-12-22 07:17:23,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12816 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4607, Invalid=26899, Unknown=0, NotChecked=0, Total=31506 [2020-12-22 07:17:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16075 states. [2020-12-22 07:17:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16075 to 3118. [2020-12-22 07:17:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-12-22 07:17:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 3907 transitions. [2020-12-22 07:17:23,968 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 3907 transitions. Word has length 147 [2020-12-22 07:17:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:17:23,969 INFO L481 AbstractCegarLoop]: Abstraction has 3118 states and 3907 transitions. [2020-12-22 07:17:23,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 07:17:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 3907 transitions. [2020-12-22 07:17:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-22 07:17:23,972 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:17:23,972 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:17:24,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:17:24,176 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:17:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:17:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash -572580853, now seen corresponding path program 1 times [2020-12-22 07:17:24,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:17:24,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584185520] [2020-12-22 07:17:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:17:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:17:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:17:24,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584185520] [2020-12-22 07:17:24,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:17:24,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:17:24,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102229465] [2020-12-22 07:17:24,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:17:24,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:17:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:17:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:17:24,328 INFO L87 Difference]: Start difference. First operand 3118 states and 3907 transitions. Second operand 6 states. [2020-12-22 07:17:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:17:26,347 INFO L93 Difference]: Finished difference Result 10577 states and 13577 transitions. [2020-12-22 07:17:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 07:17:26,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2020-12-22 07:17:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:17:26,356 INFO L225 Difference]: With dead ends: 10577 [2020-12-22 07:17:26,356 INFO L226 Difference]: Without dead ends: 7742 [2020-12-22 07:17:26,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:17:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7742 states. [2020-12-22 07:17:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7742 to 3199. [2020-12-22 07:17:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2020-12-22 07:17:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 4003 transitions. [2020-12-22 07:17:27,008 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 4003 transitions. Word has length 149 [2020-12-22 07:17:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:17:27,008 INFO L481 AbstractCegarLoop]: Abstraction has 3199 states and 4003 transitions. [2020-12-22 07:17:27,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:17:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4003 transitions. [2020-12-22 07:17:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-22 07:17:27,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:17:27,011 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:17:27,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-22 07:17:27,012 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:17:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:17:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -146521997, now seen corresponding path program 1 times [2020-12-22 07:17:27,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:17:27,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204909450] [2020-12-22 07:17:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:17:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:17:27,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:17:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:17:27,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:17:27,255 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:17:27,255 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:17:27,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-22 07:17:27,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:17:27 BoogieIcfgContainer [2020-12-22 07:17:27,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:17:27,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:17:27,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:17:27,543 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:17:27,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:16:00" (3/4) ... [2020-12-22 07:17:27,546 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:17:27,793 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c-witness.graphml [2020-12-22 07:17:27,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:17:27,796 INFO L168 Benchmark]: Toolchain (without parser) took 89695.34 ms. Allocated memory was 155.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 130.5 MB in the beginning and 726.9 MB in the end (delta: -596.3 MB). Peak memory consumption was 550.3 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,797 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 155.2 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:17:27,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.11 ms. Allocated memory is still 155.2 MB. Free memory was 130.3 MB in the beginning and 113.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 160.80 ms. Allocated memory is still 155.2 MB. Free memory was 113.1 MB in the beginning and 108.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,799 INFO L168 Benchmark]: Boogie Preprocessor took 67.55 ms. Allocated memory is still 155.2 MB. Free memory was 108.3 MB in the beginning and 104.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,799 INFO L168 Benchmark]: RCFGBuilder took 1752.00 ms. Allocated memory is still 155.2 MB. Free memory was 104.7 MB in the beginning and 56.0 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,800 INFO L168 Benchmark]: TraceAbstraction took 86832.87 ms. Allocated memory was 155.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 55.5 MB in the beginning and 775.1 MB in the end (delta: -719.6 MB). Peak memory consumption was 427.5 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,800 INFO L168 Benchmark]: Witness Printer took 251.01 ms. Allocated memory is still 1.3 GB. Free memory was 775.1 MB in the beginning and 726.9 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. [2020-12-22 07:17:27,803 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 155.2 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 623.11 ms. Allocated memory is still 155.2 MB. Free memory was 130.3 MB in the beginning and 113.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 160.80 ms. Allocated memory is still 155.2 MB. Free memory was 113.1 MB in the beginning and 108.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 67.55 ms. Allocated memory is still 155.2 MB. Free memory was 108.3 MB in the beginning and 104.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1752.00 ms. Allocated memory is still 155.2 MB. Free memory was 104.7 MB in the beginning and 56.0 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 86832.87 ms. Allocated memory was 155.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 55.5 MB in the beginning and 775.1 MB in the end (delta: -719.6 MB). Peak memory consumption was 427.5 MB. Max. memory is 8.0 GB. * Witness Printer took 251.01 ms. Allocated memory is still 1.3 GB. Free memory was 775.1 MB in the beginning and 726.9 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [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] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] i2 = init() [L58] COND FALSE !(!cond) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [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=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [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=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L148] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L151] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L537] return (1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L604] c1 = check() [L616] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L582] COND TRUE 1 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-4, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-4, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L604] c1 = check() [L616] COND TRUE ! arg VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L618] reach_error() VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 296 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 86.4s, OverallIterations: 47, TraceHistogramMax: 2, AutomataDifference: 60.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22717 SDtfs, 53878 SDslu, 74367 SDs, 0 SdLazy, 13164 SolverSat, 757 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2526 GetRequests, 1686 SyntacticMatches, 21 SemanticMatches, 819 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43828 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4094occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 46 MinimizatonAttempts, 74007 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 5965 NumberOfCodeBlocks, 5965 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 5759 ConstructedInterpolants, 0 QuantifiedInterpolants, 2534115 SizeOfPredicates, 50 NumberOfNonLiveVariables, 8002 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 56 InterpolantComputations, 39 PerfectInterpolantSequences, 762/1012 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...